scientific article; zbMATH DE number 38432
From MaRDI portal
Publication:3990643
The author proves that for any integers \(n>2\) and \(a\neq 0\) the equation \[ x(x-1)\dots(x-(n-1))+{1\over 8}\cdot n!=ay^ z \] has only finitely many \((x,y,z)\) integer solutions. From this result it follows that all the positive integer solutions of the equation \({x\choose n}={y\choose 2}\) satisfy \(\text{max}(x,y)<C\), where \(C\) is an effectively computable constant depending on \(n\).
Recommendations
Cited in
(11)- On the Diophantine equation \(\binom{n}{k} = \binom{m}{l} + d\)
- Polynomial values of figurate numbers
- Equal values of figurate numbers
- Fast algorithm for solving superelliptic equations of certain types
- scientific article; zbMATH DE number 4043931 (Why is no real title available?)
- scientific article; zbMATH DE number 1038336 (Why is no real title available?)
- scientific article; zbMATH DE number 1828039 (Why is no real title available?)
- On some polynomial values of repdigit numbers
- scientific article; zbMATH DE number 278889 (Why is no real title available?)
- Binomial collisions and near collisions
- On equal values of Stirling numbers of the second kind
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990643)