OEIS A080170 conjecture
For every integer , the binomial-coefficient gcd quantity specified in OEIS A080170 satisfies if and only if , where is the largest exact prime-power component of .
References
- Formal Conjectures issue 4252 — GitHub
Source: GitHub
Progress summary
OEIS A080170 conjectures an equivalence between a gcd condition on binomial coefficients and a condition involving the largest exact prime-power component of . The June 2026 preprint identifies this as conjecture (17) in Ralf Stephan’s collection and claims a proof for .
June 2026 formal resolution
The preprint proves , using finite differences, Lucas’ theorem, and base- arguments. The proof; the pinned source has no sorry, and the Formal Conjectures entry is marked research solved. No counterexample, error report, withdrawal, or retraction was found.
Sources
Solutions 0
No solutions have been posted yet.