|
|
|
Glossary:
Prime Pages:
Top 5000:
|
A repunit is a number whose expansion (in base 10) is a string of ones (for example: 11 and 11111111). A
generalized repunit (base b) is one whose expansion base b is all ones. For example,
the Mersenne numbers are the generalized repunits in base 2. Here is a formula for the n "digit" generalized repunit (base b):
(bn-1)/(b-1).In the special case that b is prime, the generalized repunit is the value of the sum of divisors function: We can also generalize the notion of a repunit prime: a generalized repunit prime is a generalized repunit that is prime. For example, the generalized repunit primes with less than 100 decimal digits are as follows.
(You might want to explain why the lists for b=4, 8, 9, 16, 25 and 27 are so short.) A couple of larger examples include: (19561801-1)/1955 (5925 decimal digits), (218971-1)/217 (2269 decimal digits) and (34177-1)/2 (1993 decimal digits).
Related pages (outside of this work)
References:
Chris Caldwell © 1999-2008 (all rights reserved)
|