Let be the . item of the Fibonacci sequence. How many solutions are there for the next equation, where is a positive integer?
What is the Fibonacci sequence? If you don't know then read this wiki: The Fibonacci sequence
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
It is not a real solution, but with it we get the answer:
We can notice that if 7 ∣ a m , then 8 ∣ m and if 3 ∣ a m , then 4 ∣ m . So the sequence's every item which is divisible by 7 is also divisible by 3 , so a m never will be a power of 7 .