Tag Archives: remainders

Fibonacci multiples, solution 1

Posted on June 9, 2012 by Brent

In a previous post, I challenged you to prove If evenly divides , then evenly divides , where denotes the th Fibonacci number (). Here’s one fairly elementary proof (though it certainly has a few twists!). Pick some arbitrary and … Continue reading →

Posted in fibonacci, modular arithmetic, number theory, pattern, pictures, proof, sequences | Tagged , , , | 5 Comments