Abstract
For more than three centuries it has been a conjecture that the Diophantine equation
has no solutions in natural numbers x, y, z for all n > 2. At present this conjecture, which is also called ”Fermat’s Last Theorem”, is known to be true for all n ≤ 125 000 [1]. Moreover, the recent work of G. Faltings (see [1]) implies that, for each n ≥ 3, (1) has at most a finite number of solutions (x, y, z), with (x, y, z) = 1 and xyz ≠ 0.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Heath-Brown, D.R. ”The first case of Fermat’s Last Theorem.” Math. Intelligencer 7, Nr. 4 (1985): pp 40–47, 55.
Sierpinski, W. ”Elementary Theory of Numbers.” Warszawa 1964.
Singmaster, D. ”Repeated binomial coefficients and Fibonacci numbers.” The Fibonacci Quarterly 13 (1975): pp 295–298.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer Science+Business Media New York
About this chapter
Cite this chapter
Harborth, H. (1988). Fermat-Like Binomial Equations. In: Philippou, A.N., Horadam, A.F., Bergum, G.E. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-7801-1_1
Download citation
DOI: https://doi.org/10.1007/978-94-015-7801-1_1
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8447-7
Online ISBN: 978-94-015-7801-1
eBook Packages: Springer Book Archive