ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥2n\ge 2 be an integer and let q≥2q\ge 2 be a prime power. Define the projective degree

m=qn−1q−1=1+q+q2+⋯+qn−1.m=\frac{q^n-1}{q-1}=1+q+q^2+\cdots+q^{n-1}.

A projective prime is a prime value of mm. The projective-prime infinitude conjecture. There are infinitely many projective primes. Heuristic arguments and computational evidence support this conjecture, but the infinitude of projective primes remains open; it includes the unresolved infinitude questions for Fermat and Mersenne primes.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.