Proves D(k)=1 iff n/P > P for n=k+1 and P the largest prime power dividing n, with both natural-language proof and Lean formalization generated by an AI agent.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Greatest Common Divisor Criterion of Certain Binomial Coefficients
Proves D(k)=1 iff n/P > P for n=k+1 and P the largest prime power dividing n, with both natural-language proof and Lean formalization generated by an AI agent.