Determinism conjecture for the generalized Cullen number primality algorithm
Statement
Let and be positive integers, and let the algorithm described in the paper test the generalized Cullen number . The algorithm is called deterministic when every tested generalized Cullen prime is certified as such and the output PRIME NUMBER guarantees primality.
Determinism conjecture. If
then the algorithm is deterministic.
The algorithm is otherwise only quasi-deterministic: a PRIME NUMBER output certifies that the tested integer is prime, but the algorithm might fail to certify a generalized Cullen prime. Computational evidence reported in the paper suggests that such primes occur only when , and that the auxiliary value used in step 3 is small relative to .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.