| The set described in .0 contains all primes of the forms:
111...11, i.e., all one's in decimal, or (10^n - 1)/9
100...01, i.e., one more than a power of ten, or 10^n + 1
Primes of either form are discussed in other notes in this
file (both are palindromic primes; the first are called
repunits; so DIR/TITLE=PALIND or DIR/TITLE=REPUNIT may find
them, but I haven't checked that). For (10^n - 1)/9 to be
prime, n must be prime. For 10^n + 1 to be prime, n must be
a power of two. In a sense these are the base ten analogs
of the Mersenne primes and the Fermat primes.
>> .0 How many elements do you suppose there are in the set?
>> .2 Right. And Dan has interesting things to say about how many
>> of these there are.
To the best of my knowledge, it is an open problem whether
there are finitely many or infinitely many of either of
these very restricted types of primes (which are a subset of
the palindromic primes, which are a subset of the "forward-
and-backward" primes of .0).
On the other hand, I think only four or five primes of the
first type are known, and certainly even fewer of the
second.
Dan
|