Paperlane

no. 7 · Tuesday 3 November 2026

Infinitely Many Binomial Coefficients of Deficiency One

Xu Zhang

math.NT · v2

Abstract

A binomial coefficient $\binom{n}{k}$ is good if all its prime divisors exceed $k$, and its deficiency is the number of $k$-smooth integers in $(n-k,n]$. A short constructive proof of the existence of infinitely many good binomial coefficients with deficiency exactly one is given, which provides an answer to a problem of Erdős, Lacampagne, and Selfridge.

comments
The main result, Theorem 1.1, dose not hold. An error is the reversal of the no-carry condition: the correct condition is $a_j+b_j\leq p-1$, not $b_j\geq a_j$
fields
Number Theory
pdf ↗ page arXiv:2609.25042 ↗