Low Price Guarantee
We Take School POs
13 Lectures on Fermat's Last Theorem Softcover Repri Edition
Contributor(s): Ribenboim, Paulo (Author)

View larger image

ISBN: 144192809X     ISBN-13: 9781441928092
Publisher: Springer
OUR PRICE: $52.24  

Binding Type: Paperback - See All Available Formats & Editions
Published: December 2010
Qty:
Additional Information
BISAC Categories:
- Mathematics | Number Theory
- Gardening
- Computers | Computer Science
Dewey: 004
Physical Information: 0.69" H x 6.14" W x 9.21" L (1.01 lbs) 302 pages
 
Descriptions, Reviews, Etc.
Publisher Description:
Fermat's problem, also ealled Fermat's last theorem, has attraeted the attention of mathematieians far more than three eenturies. Many clever methods have been devised to attaek the problem, and many beautiful theories have been ereated with the aim of proving the theorem. Yet, despite all the attempts, the question remains unanswered. The topie is presented in the form of leetures, where I survey the main lines of work on the problem. In the first two leetures, there is a very brief deseription of the early history, as well as a seleetion of a few of the more representative reeent results. In the leetures whieh follow, I examine in sue- eession the main theories eonneeted with the problem. The last two lee tu res are about analogues to Fermat's theorem. Some of these leetures were aetually given, in a shorter version, at the Institut Henri Poineare, in Paris, as well as at Queen's University, in 1977. I endeavoured to produee a text, readable by mathematieians in general, and not only by speeialists in number theory. However, due to a limitation in size, I am aware that eertain points will appear sketehy. Another book on Fermat's theorem, now in preparation, will eontain a eonsiderable amount of the teehnieal developments omitted here. It will serve those who wish to learn these matters in depth and, I hope, it will clarify and eomplement the present volume.
 
Customer ReviewsSubmit your own review
 
To tell a friend about this book, you must Sign In First!