From: Ludovicus on
"For each prime p there is a base B such that (B^p - 1) / (B -1) =
prime"
The least bases for the first 12 primes are:

p = 2 3 5 7 11 13 17 19 23 29 31 37

B= 2 2 2 2 5 2 2 2 10 6 2
61

Ludovicus
From: Gerry Myerson on
In article
<6fb87751-8288-492a-bc4c-fd0e4def9e46(a)k39g2000yqd.googlegroups.com>,
Ludovicus <luiroto(a)yahoo.com> wrote:

> "For each prime p there is a base B such that (B^p - 1) / (B -1) =
> prime"
> The least bases for the first 12 primes are:
>
> p = 2 3 5 7 11 13 17 19 23 29 31 37
>
> B= 2 2 2 2 5 2 2 2 10 6 2
> 61

See http://www.research.att.com/~njas/sequences/A066180

--
Gerry Myerson (gerry(a)maths.mq.edi.ai) (i -> u for email)
From: Ludovicus on
On 29 jul, 00:10, Gerry Myerson <ge...(a)maths.mq.edi.ai.i2u4email>
wrote:
>
>  Ludovicus <luir...(a)yahoo.com> wrote:
> > "For each prime p there is a base B such that  (B^p - 1) / (B -1) =
> > prime"

> Seehttp://www.research.att.com/~njas/sequences/A066180
> Gerry Myerson

Thanks for the reference, but it is or not a theorem.
Ludovicus

From: Gerry on
On Jul 31, 3:04 am, Ludovicus <luir...(a)yahoo.com> wrote:
> On 29 jul, 00:10, Gerry Myerson <ge...(a)maths.mq.edi.ai.i2u4email>
> wrote:
>
>
>
> >  Ludovicus <luir...(a)yahoo.com> wrote:
> > > "For each prime p there is a base B such that  (B^p - 1) / (B -1) =
> > > prime"
> > Seehttp://www.research.att.com/~njas/sequences/A066180
> > Gerry Myerson
>
> Thanks for the reference, but it is or not a theorem.

It's pretty clear that no one who has looked at that webpage
has been able to decide whether such B exists for each p.
--
GM