Tag Archives: repunit

Fun with repunit divisors: more solutions

Posted on November 17, 2011 by Brent

In Fun with repunit divisors I posed the following challenge: Prove that every prime other than 2 or 5 is a divisor of some repunit. In other words, if you make a list of the prime factorizations of repunits, every … Continue reading →

Posted in arithmetic, iteration, modular arithmetic, number theory, primes, programming, proof, solutions | Tagged | Comments Off on Fun with repunit divisors: more solutions

Fun with repunit divisors: proofs

Posted on November 16, 2011 by Brent

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

Fun with repunit divisors

Posted on November 11, 2011 by Brent

In honor of today’s date (11/11/11), here’s a fun little problem (and some follow-up problems) I’ve seen posed in a few places (for example, here is a very similar problem). If I recall correctly, it was also a problem on … Continue reading →

Posted in arithmetic, challenges, modular arithmetic, number theory, primes | Tagged , , | 16 Comments