ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For n∈Nn\in\mathbb{N}, let

wn=(2n−1n−1).w_n=\binom{2n-1}{n-1}.

Consider pairs of distinct primes pp and qq for which the congruence wp≡1(modq2)w_p\equiv 1\pmod{q^2} holds. Hussein's conjecture. For all but at most finitely many pairs of distinct primes pp and qq,

wp≡1(modq2)  ⟹  q<p.w_p\equiv 1\pmod{q^2}\implies q<p.

The conjecture is motivated by computations suggesting that, for large pp, prime divisors q>pq>p satisfying the congruence should not occur, apart from finitely many exceptions. The source gives no resolution, so 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.