Do Fibonacci numbers reach every number modulo m? – math.stackexchange.com

Do Fibonacci numbers reach every number modulo m? – math.stackexchange.com

13:31 No Comments
I want to show that: $ \forall x,m \; \exists n : x \equiv_m F_n $ I assume that one can prove this by the pigeonhole principle, but I couldn't manage to find a series of m+1 numbers that each want ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

Artikel Terkait

0 Comment to "Do Fibonacci numbers reach every number modulo m? – math.stackexchange.com"

Post a Comment

Subscribe to: Post Comments (Atom)