No label defined (Q3990643)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 38432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 38432 |
Statements
28 June 1992
0 references
superelliptic diophantine equation
0 references
binomial coefficient
0 references
0.8087500333786011
0 references
0.7986893653869629
0 references
0.7923913598060608
0 references
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\).
0 references