Tag Archives: divisibility

Fibonacci multiples, solution 1

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

Fibonacci multiples

I haven’t written anything here in a while, but hope to write more regularly now that the semester is over—I have a series on combinatorial proofs to finish up, some books to review, and a few other things planned. But … Continue reading

Posted in arithmetic, challenges, fibonacci, number theory, pattern | Tagged , | 12 Comments

Fun with repunit divisors: proofs

As promised, here are some solutions to the repunit puzzle posed in my previous post. (Stop reading now if you don’t want to see solutions yet!) Prove that every prime other than 2 or 5 is a divisor of some … Continue reading

Posted in iteration, modular arithmetic, number theory, pattern, primes, proof | Tagged , , , , | 1 Comment