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\).











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)