ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p≥3p\ge 3 be prime and set Np=2p−1N_p=2^p-1. The squarefreeness conjecture. There exists p0p_0 such that, if p>p0p>p_0, then NpN_p is squarefree. Squarefreeness would rule out repeated prime factors in sufficiently large prime-indexed Mersenne numbers; the source presents this as a conjecture following heuristic discussion.

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.