30 Jan
2012
30 Jan
'12
12:42 p.m.
On Mon, Jan 30, 2012 at 11:03 AM, Warren Smith <warren.wds@gmail.com> wrote:
From: David Wilson <davidwwilson@comcast.net>
I can also show that the reciprocal of the smallest prime p > 10^d with primitive root 10 includes every d-digit block. I can show that if p < 2*10^d,
--you do not need this "if" because of the known theorem that there is always a prime between X and 2X if X>1: http://en.wikipedia.org/wiki/Bertrand's_postulate
Bertrand's postulate tells us there is a prime between 10^d and 2*10^d. But what I think David Wilson needs as an assumption is the stronger statement that there is a prime p between 10^d and 2*10^d such that 10 is a primitive root mod p. Andy