New revision of "A pb on the conj. concerning the distribution of GF primes"
- A new revision of "A problem on the conjecture concerning the distribution
of generalized Fermat prime numbers (a new method for the search for large
primes)" is available at
Pieter Moree indicated to me a generalization of Shanks' formula for the
computation of all C_n. The formula and method is indicated in this paper
and 20 digits of C_1, C_2, ..., C_12 were computed. However the method is
still unpractical for large n and we cannot yet estimate if we have more
chance to find a prime with k.2^10000000+1 or with k.2^10000001+1... but if
one of you has a good idea on how to solve this problem...
Note that the Inverse Symbolic Calculator failed to recognize these