The arithmetic progression nonvanishing conjecture for Fermat quotients

For a prime p>2p>2, write q2(p)=(2p11)/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 pa(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.

Sources & referencesView supporting material

Primary source

Jianqiang Zhao, “Finite and Symmetric Euler Sums and Finite and Symmetric (Alternating) Multiple T-Values”, arXiv:2403.18075 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.