Equal binomial coefficients: Some elementary considerations (Q1355097): Difference between revisions

This paper considers the problem of finding the natural numbers that occur at least twice as binomial coefficients \({n \choose k}\). To avoid trivial solutions, \(k\) is restricted to \(2\leq k\leq {1\over 2} n\). First the author gives an overview of nontrivial solutions known to date, and he conjectures that there are no others. As a contribution towards settling this conjecture the author provides the complete set of solutions of the equation \[ {n \choose 3}= {m \choose 4}. \tag{1} \] In order to prove his result, the author applies a theorem of \textit{L. J. Mordell} [Pac. J. Math. 13, 1347-1351 (1963; Zbl 0124.27402)] on the integer solutions of the diophantine equation \[ Y^2+ Y=X^3 -X. \tag{2} \] Two further theorems are given and proved. First, equation (1) is a model for a curve of genus 3 and hence has only finitely many solutions in rational numbers \(m\) and \(n\). The author proves that there are only two rational solutions with 2-power denominators, and he conjectures that there are no other rational solutions than these: \((n,m) =({5 \over 4}, {1\over 2})\), \(({5 \over 4}, {5\over 2})\). Second, the author gives all rational solutions with 2-power denominators of the Mordell equation (2).