1

As a background I know nothing about how the golden ratio is used in actual mathematics or any formulae and such (only seen it used in a few examples I've seen online).

But then while messing on the Desmos graphing calculator with just graph intersections/simultaneous equations, i see that:

$x^2 + x = x^3\, $ when $\, x = 1.618033988749894\, $ (i.e: the golden ratio)

I'm really curious because I've never used the golden ratio in maths before, and now like the mathematicians of the past saw it come up randomly.

Edit: feel a bit stupid now, considering that if I just did a tiny bit more searching I would have gotten it probably very quickly. But thanks everyone for the simple and easy answers!

Ibsy
  • 11
  • 5
    The golden ratio satisfies $x+1=x^2$ – J. W. Tanner Oct 22 '23 at 18:53
  • 1
    Based on the definition, it can be seen that $\frac{\phi}{1} = \frac{1}{\phi - 1}$, giving $\phi^2-\phi-1=0$. – Anton Vrdoljak Oct 22 '23 at 18:57
  • You might be more familiar with the idea of the golden ratio being related to the Fibonacci sequence. The polynomial equation mentioned above is the characteristic equation (if you are not familiar with that term see for example https://math.stackexchange.com/questions/166743/how-to-get-the-characteristic-equation or https://en.wikipedia.org/wiki/Characteristic_equation_(calculus)) of the Fibonacci recurrence formula https://en.wikipedia.org/wiki/Fibonacci_sequence#Generating_function – userrandrand Oct 22 '23 at 19:16

1 Answers1

1

In the given case, the short aswer could be that it is well known that the only positive solution of $\phi^2-\phi-1=0$ is given by $\frac{1+\sqrt{5}}{2}$ so that a solution of $\phi^2-\phi-1=0$ is also a solution of $\phi^3-\phi^2-\phi=0 \Rightarrow \phi\cdot(\phi^2-\phi-1)=0$.

Now, we observe that the golden ratio appears often in graph theory optimization problems, as an example just take a look at what happens in this paper of mine, pp. $163-165$: Golden ratio in a random optimization problem.
Basically, the problem there was as follows: Let the grid $\{\{0,1\} \times \{0,1\} \times \{0,1\}\} \subset \mathbb{R}^3$ be given. Our goal is to find a polygonal chain characterized by the minimum link-length (i.e., with $6$ edges) which subtends the minimum volume Axis-Aligned Bounding Box.

The volume of the optimum AABB is "surprisingly" given by $\left[\frac{1-\phi}{2}+\epsilon, \frac{1+\phi}{2} \right] \times \left[\frac{4\cdot \phi \cdot \epsilon}{1-\phi+2 \cdot \epsilon}, 1+\phi\right] \times \left[0, \frac{1+\phi}{2}\right]$, where $\mathbb{R} \ni \epsilon \rightarrow 0$.

Marco Ripà
  • 1,292