Prove that in the Fibonacci sequence (0, 1, 1, 2, 3, 5, 8, 13, ... where each number is the sum of the two previous) there's at least one number that ends in 999999.
(In reply to
Problem Solution by K Sengupta)
My deleted comment made 9 years before makes it amply clear that I was unable to arrive at a solution on my own.
Now, in January and February this year, the entire Math Forum site including "Ask Dr. Math" was moved from math forum.org to www.nctm.org/tmf and made inaccessible to non-members.
Since June this year, it seems that one can now access "Ask Dr. Math" archives at www.nctm.org/drmath by creating a free NCTM account.
Source: the Math Doctors(www.themathdoctors.org), "What Happened to Dr. Math"
Since Federico Kereki gave only an "Ask Dr. Math" link in his official solution, the same stands invalid in view of the foregoing.
Comsequently, Nick Hobson's well-explained and concise solution must NOW serve as the solution to the given problem.
Edited on December 19, 2021, 11:53 am
Problem Thoughts
