Hasler's ternary structural infinitude conjecture for binomial congruences

From papers

Let nn be a positive integer, and let qq and pp be primes with pqp\neq q. The binomial congruence is

(qnn)qn(modn).\binom{qn}{n}\equiv q^n\pmod n.

Hasler's structural infinitude conjecture. The equation (3nn)3n(modn)\binom{3n}{n} \equiv 3^n \pmod{n} has infinitely many solutions of the form n=3kpn=3^k\cdot p, where kk is a positive integer and pp is a prime number. More generally, the equation (qnn)qn(modn)\binom{qn}{n} \equiv q^n \pmod{n} has infinitely many solutions of the form n=qkpn=q^k\cdot p, where pqp\neq q are prime numbers and kk is a positive integer.

This conjecture proposes infinitely many prime-times-prime-power solutions, extending the observed ternary examples recorded in OEIS sequence A080469. The supplied text gives no resolution, so the conjecture remains open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Gabriel Araújo Guedes and Ricardo Nunes Machado Junior, “Structured Solutions of Prime-Base Binomial Congruences”, arXiv:2606.30232 (2026).

Solutions 0

No solutions have been posted yet.