Fibonacci and 7

Number Theory Level pending

Let a n a_n be the n n . item of the Fibonacci sequence. How many solutions are there for the next equation, where k k is a positive integer?

7 k = a m 7^k=a_m


What is the Fibonacci sequence? If you don't know then read this wiki: The Fibonacci sequence

5 2 4 0 1 More than 5, but not infinite 3 Infinite

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.

1 solution

It is not a real solution, but with it we get the answer:

We can notice that if 7 a m 7|a_m , then 8 m 8|m and if 3 a m 3|a_m , then 4 m 4|m . So the sequence's every item which is divisible by 7 7 is also divisible by 3 3 , so a m a_m never will be a power of 7 7 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...