
Glossary: Prime Pages: Top 5000: 
The hardware and software on this system was updated September 4th.
Please let me know of any problem you encounter.
<caldwell@utm.edu> 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: (10^{317}1)/9; and with 1,031 digits: (10^{1031}1)/9. During 1999 Dubner discovered R_{49081} = (10^{49081}1)/9 was a probable prime, and in October 2000, Lew Baxter discovered the next repunit probable prime after that is R_{86453}. In 2007 the probable primes R_{109297} (Bourdelais and Dubner) and R_{270343} (Voznyy and Budnyy) were found. It will be some time before these giants is proven prime! As the poet wrote: Ah, but a mans reach should exceed his grasp, or whats 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. Because of their very special form, a repunit prime is also a circular prime and a palindromic prime.
See Also: GeneralizedRepunit References:
Chris K. Caldwell © 19992014 (all rights reserved)
