The term
repunit comes from the words 'repeated' and
'unit;' so
repunits are positive integers in
which every digit is one. (This term was
coined by A. H. Beiler in [Beiler1964].)
For example, R
1=1,
R
2=11, R
3=111, and
R
n=(10
n-1)/9.
Notice R
n divides R
m
whenever
n divides
m.
Repunit primes are repunits that are prime.
For example, 11, 1111111111111111111, and
11111111111111111111111 (2, 19, and 23 digits). The only
other known repunit primes are the ones with 317 digits:
(10317-1)/9, 1,031 digits and
(101031-1)/9.
During 1999 Dubner discovered
R49081 = (1049081-1)/9 was a
probable prime. In October 2000, Lew Baxter
discovered the next repunit probable prime is
R86453. It will be some time
before this giant is proven prime! As the poet wrote:
Ah, but a man's reach should exceed his grasp, or what's a heaven for? (Robert Browning)
Even though only a few are known, it has been
conjectured
that there are infinitely many repunit primes. To see why
just look at the graph of the known repunit primes and
probable primes (here
we graph
log(log(R
n)) verses
n.