- Find a joual-speaking author who may be googled

by supplying the next prime of this sequence:

31, 19, 23, 139, 6089, 40949, 13153513, 748105003 ...

Hint: The n'th prime in the sequence is the first of a

sequence of n+1 primes obtained by a base-10 procedure.

Comment: If you answer with the name of the author,

you will be unlikely to spoil the puzzle for others.

David Mark Underwood wrote:

> I gave it a go. Discovering the 'base-10 procedure' was the easy part,

Well done. Mark. Here is the solution, with an extra term:

> but my computer protested finding the next value in the sequence.

> Finally it found the number, ending in 4673.

> Find a joual-speaking author who may be googled

The first 10 members of the sequence are

> by supplying the next prime of this sequence:

> 31, 19, 23, 139, 6089, 40949, 13153513, 748105003 ...

> Hint: The n'th prime in the sequence is the first of a

> sequence of n+1 primes obtained by a base-10 procedure.

31, 19, 23, 139, 6089, 40949, 13153513, 748105003, 11307204673, 202073177599

a[n] is the smallest prime that remains prime for precisely

n times when its final decimal digit is repeated.

Examples:

a[9] =

11307204673 is prime, so are

113072046733,

1130720467333,

11307204673333,

113072046733333,

1130720467333333,

11307204673333333,

113072046733333333,

1130720467333333333,

11307204673333333333, but

113072046733333333333 is composite.

No prime smaller than 11307204673 has this

property of precisely 9 prime repetitions.

a[10] = 202073177599

print(isprime(vector(13,k,2020731776*10^k-1)))

[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]

Googling 11307204673, we obtain

http://www.abebooks.com/Premier-quartier-lune-Michel-Tremblay-LEM%C3%83/11307204673/bd

leading us to

http://fr.wikipedia.org/wiki/Michel_Tremblay> Il intègrera le dialecte québécois "joual" dans ses pièces

David