I found the following problem on K. Rustan M. Leino’s puzzles page: [Carroll Morgan told me this puzzle.] Prove that for any positive K, every Kth number in the Fibonacci sequence is a multiple of the Kth number in the Fibonacci sequence. More formally, for any natural number n, let F(n) denote Fibonacci number n. [...]
-
‹ Home
Contents
-
Subscribe
Subscribe Joao's blog to stay informed of changes and new posts. You can also receive notifications by email. -
Categories
-
Tags
Algorithms archlinux blog calculational check combinatorics computing correction correctness distributivity domain Education fibonacci fingerprint future goal-oriented graph graph theory grid hoare irrationality joaoff.com knuth lenovo Links Linux Mathematics Methodology Opinion Perl Personal Programming proof proofs puzzles quantifiers quotes research Science tablet thinkfinger timeout university usb_bulk_read vertex
-
Archives
Blogs
Links
-
RSS Feeds