The primitive-divisor conjecture for the sequence 2^d-3
Statement
For each positive integer , consider the integer . A primitive prime divisor of is a prime divisor that divides none of the earlier terms with . Primitive-divisor conjecture. For every , there is a primitive prime divisor of ; equivalently, after checking the cases , the Zsigmondy set of the sequence is exactly . This conjecture is used only for a short conjectural proof of the nonexistence of the relevant subgroup; the paper also gives a complete longer proof, so the surrounding group-theoretic conclusion is established independently.
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.