Golden Ratio
Ratio where the whole is to the larger as the larger is to the smaller.
Formula
Variables
Example
Appears in art and nature
How it works
The golden ratio is the positive value of a number that satisfies the equation \(x = 1 + \frac{1}{x}\), which comes from splitting a line so the whole segment and the longer part have the same ratio as the longer part and the shorter part. Solving \(x^2 = x + 1\) gives \(x = \frac{1+\sqrt{5}}{2}\approx 1.618\), the only positive solution. This ratio appears naturally in recursive patterns and self-similar growth because each new part is proportional to the previous one in a very specific way.
When to use it
Use the golden ratio when a problem asks for the proportion between two parts and the whole under the condition that the same ratio repeats at each division. It is also useful in geometry, sequences like the Fibonacci numbers, and design problems involving proportions.
Worked example, step by step
Suppose a line segment is split into a longer part \(a\) and a shorter part \(b\) so that \(\frac{a+b}{a} = \frac{a}{b}\). Let \(\frac{a}{b} = \varphi\), so \(\varphi = \frac{1+\sqrt{5}}{2}\approx 1.618\). If the shorter part is \(b = 10\) cm, then the longer part is \(a = 1.618 \times 10 = 16.18\) cm. The whole segment is \(a+b = 16.18 + 10 = 26.18\) cm. Check: \(\frac{26.18}{16.18} \approx 1.618\) and \(\frac{16.18}{10} \approx 1.618\), so the division matches the golden ratio.
Common mistakes to avoid
- Using \(\varphi\) as if it were exactly 1.6 instead of about 1.618
- Swapping the larger and smaller parts, which gives the reciprocal \(1/\varphi\) instead of \(\varphi\)
- Assuming any aesthetically pleasing proportion is automatically the golden ratio
Did You Know?
The golden ratio appears in art, architecture, and the Parthenon, long dubbed the most pleasing proportion.
Share this formula
More in Number Theory
View allEuclidean Algorithm
BasicRecursively finds the greatest common divisor.
Modular Congruence
Basica and b have the same remainder when divided by m.
Fermat's Little Theorem
AdvancedHolds when p is prime and gcd(a,p)=1.
Euler's Totient
AdvancedCounts integers up to n coprime to n.
Prime Number Theorem
AdvancedApproximates the number of primes below x.
LCM from GCD
BasicLeast common multiple via the greatest common divisor.