ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n=am+1n=am+1, where aa and mm are positive integers, and let pp be the least prime divisor of mm. Primality conjecture. If a<pa<p and m∣ϕ(n)m\mid\phi(n), then nn is prime. This conjecture would generalize the preceding primality criterion from numbers of the form apk+1ap^k+1 to a broader class of integers. The source reports substantial experimental evidence but does not establish the converse or otherwise resolve the conjecture.

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.