ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a prime p>2p>2, write q2(p)=(2p−1−1)/2q_2(p)=(2^{p-1}-1)/2. Arithmetic progression nonvanishing conjecture. For every pair of positive integers m>a>0m>a>0 with gcd⁡(m,a)=1\gcd(m,a)=1, there are infinitely many primes p≡a(modm)p\equiv a\pmod m such that

q2(p)≢0(modp).q_2(p)\not\equiv0\pmod p.

This asserts nonvanishing of the Fermat quotient of 22 in every reduced arithmetic progression. The source says it is believed to be true but gives no proof or resolution.

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.