primes of the form q^2-q+1 with q=2^p-1 for prime p
Max
maxale at gmail.com
Fri Feb 17 13:57:13 CET 2006
On 2/17/06, Farideh Firoozbakht <mymontain at yahoo.com> wrote:
> > Can anybody prove that P(p) can never be prime for prime p or
> > find prime P(p) for some prime p (in which case p must be > 150000) ?
>
> Note that P(2)=7 & P(3)=43, so I think your question should be:
>
> Can anybody prove that P(p) can never be prime for prime p, p>3 or
> find prime P(p) for some prime p>3 (in which case p must be > 150000) ?
Thanks for pointing this out!
Yes, p must be greater than 3. I forgot to mention that.
btw, the problem has an algebraic origin as it appeared in research
related to PU_3(q) groups. And the author of original message about
this problem is very much interested in getting the answer.
Max
More information about the SeqFan
mailing list