Fibonacci Shmibonacci
[Disclaimer: I am not a mathematician - and I don't even play one on TV - so my terminology may not always be correct, but I try to get the nature of my observations across in "lay" terms; I think/hope I've done so. Of course, feel free to contact me with any corrections/refinements to my usage of mathematical(or pseudo-mathematical) terms.]
Yearses ago (before the Internet had good search capability), I made an aboservation related to the Fibonacci sequence, viz., not only are there an infinite number of sequences that lead to the calculation of φ (phi), the "golden ratio," but that the Fibonacci sequence (and its look-alikes, e.g., Lucas) can be used to calculate one root of the quadratic equation x2 + x -1 = 0; and if you extend the series before 1 1 2 you can find the other root:
… -144 89 -55 34 -21 13 -8 5 -3 2 -1 1 0 1 1 2 3 5 8 13 21 34 55 89 144 …
The ratio Sn/Sn-1 will be a root (read alternative quotient section for more info). The farther out you go in either direction, the closer the approximation will be. (Note that the same “direction” of numerator and denominator must be the same on both ends of the sequence). For the above sequence and equation the roots are (approximately) -144/89 (-1.61797753) & 89/144 (0.61805556) which are close to the actual roots using the quadratic formula.
[The equation that does provide the golden ratio (φ) using the quotient as described here is actually x2 - x -1 = 0 with the sequence … 144 89 55 34 21 13 8 5 3 2 1 1 0 1 -1 2 -3 5 -8 13 -21 34 -55 89 -144 … :: 144/89 (1.61797753) & 89/-144 (-0.61805556).
This can also be generalized to other quadratic equation: c2x2 + c1x – c0 = 0 with a sequence where c2*Sn + c1*Sn+1 + c0*Sn+2 = 0.
Furthermore, it doesn’t stop there: almost ANY polynomial equation of order P — cpxp + cp-1xp-1 + cp-2xp-2 + ………… +c2x2 + c1x1 - c0x0 = 0 — can be solved with a sequence (infinite in both directions) such that the sum of ((cp*Sn) + (cp-1*Sn+1) + (cp-2*Sn+1) + … + (c1*Sn+p-1) + (c0*Sn+p)) = 0.
For years, I would search the Internet every once in a while to see whether these observations of mine had already been made, but it didn’t look as though it had.
When I recently came across Numberphile and Matt Parker's Stand-up Maths (with their seeming obsession with Fibonacci sequences and Fibonacci-wannabes) as well as other math videos, and none of them indicated knowledge of this correlation, I became more assured that I had made a discovery. Some of the YouTube videos sometimes came close, sometimes oh-so close, to this correlation but didn’t make the leap to the association between the equation and the sequence. [Videos I've viewed.]
As it turns out, at least some my observations are well-known mathematics, but as I research this, I am presenting my findings (in the hope that some of them are novel).
I've found some interesting and puzzling things about these sequences and associated equations:
There are instances when the sequence does not seem to solve the associated polynomial equation, i.e., the quotient of adjacent numbers does not (or cannot) converge.
I've identified at least two patterns where this happens - hence the "almost" in my intro:
The rate at which a sequence converges to a solution depends on the relative magnitude of the coefficients: when the coefficients are of the same order of magnitude, the sequence will converge faster. (That's why the Fibonacci sequence converges so quickly - all coefficients of magnitude 1.) This is probably why equations with missing terms "misbehave;" the 0 coefficient(s) are of infinitely smaller magnitude than the other coefficient. [By changing the 0 to a very small number, the new factor will change the actual solution by a negligible amount, it will produce a well-behaved sequence and a solution very close - but convergence will be sloooooooooooooow.]
[As far as roots to equations higher than linear with imaginary components, I don't think creating sequences with complex numbers will help, as they really are just the addition of two sequences that fit the equation. See the section Sequence Addition.]
e.g.
|
|
One implication is that any sequence - even one that fits a lesser order, even a linear, equation - that fits a polynomial equation will provide a solution. Try the sequences in the above tables with the 4th-order equation created.
[If you create sequences for linear equations of the solutions to x2 + x -1 = 0, viz. ((1+sqrt(5))/2)x -1 = 0 or (1-sqrt(5))/2)x -1 = 0), they will also fit both the quadratic and 4th power equations: e.g. … 1 -0.618 0.382 -0.236 0.146 -0.090 0.058 -0.034 0.021 ... (I've used decimal approximations, but you can just as well use actual mathematical notation, with the actual quadratic formula, to create the sequence; it just gets messy, having to do division with squares of the formula which contains sqrt(5).)]
x2 - 1 = 0: … 2, 0, 2, 0, 2, … (#DIV/0!) ⇒ … 2, -2, 2, -2 … (tada!, sequence still fits the equation, but no division problems)
(This observation is not reflected in the main spreadsheet.)
[I think it is beneficial to use the sums of x numbers for polynomial of the xth power; it may mitigate some instances of non-convergence, though I need to do additional work on this.]
Tree diagrams
In addition to simple number sequences, I am looking into tree diagrams, where different node types transform into a new set of node(s). From the little work I've done, I sense a relationship to these sequences, but I need to do more before I can tell how true that is.
(I took this direction after reading about Fibonacci rabbits. I figured that if the Fibonacci sequence corresponds to a tree, other polynomials should, too.)
Below are links to files that illustrate the concepts on this page:
|
|
[I'm working on a spreadsheet that will be more flexible and allow a wider range of polynomials. (The current spreadsheets have sheets that are fixed for equations up to 5th power.)]
For further Investigation
Quest for Full Solutions
Since a sequence with only two ends can seemingly provide only two solutions, I’m still looking for a procedure that will find all solutions to higher order equations.
I'm particularly interested in how to construct the sequence - i.e., what "seed values" to choose - to ensure that a real solution will be found if there is one.
When Sequences Fail (a/k/a misbehaving sequences)
So far, I've identified two situations in which the quotient of two numbers does not compute a solution to the equation correlated to a sequence:
I’m not sure whether either or both of these is a matter of manipulating a single sequence in a new way or finding a different sequence, e.g., by using different “seed” values.
If you have any thoughts on this, email me.