ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a prime power qq and an integer n≥2n\ge 2, call a prime

p=1+q+⋯+qn−1p=1+q+\cdots+q^{n-1}

a projective prime. Let n≥3n\ge 3 be prime and let ee be a fixed power of nn.

Conjecture on projective primes with prime-power bases. For each fixed prime n≥3n\ge 3 and each fixed power ee of nn, there are infinitely many projective primes of the form p=1+q+⋯+qn−1p=1+q+\cdots+q^{n-1} where qq is the ee-th power of a prime.

This is a Bateman--Horn-supported refinement of the broader infinitude conjecture for projective primes, based on computational evidence; it remains open.

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.