Diophantine approximation
Our rough guess is there are 74,750 words in this book.
At a pace averaging 250 words per minute, this book will take 4 hours and 59 minutes to read. With a half hour per day, this will take 10 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
74,750 words, Guess
Page Count
299 pages
Identifiers
- Internet Archivemanaginginformat00john
- ISBN-100387097627
- ISBN-139780387097626
- Library of Congress Control Number80011695
- OCLC Control Number6085841
and 3 more
- Better World Books9780387097626
- Better World BooksKS-083-683
- Open LibraryOL4097406M
Classifications
- DDC510 s
- DDC512/.74
- LCCQA3 .L28 no. 785
and 2 more
- LCCQA247 .L28 no. 785
- LCCQA76.9.A25
Description
"In 1970, at the U. of Colorado, the author delivered a course of lectures on his famous generalization, then just established, relating to Roth's theorem on rational approxi- mations to algebraic numbers. The present volume is an ex- panded and up-dated version of the original mimeographed notes on the course. As an introduction to the author's own remarkable achievements relating to the Thue-Siegel-Roth theory, the text can hardly be bettered and the tract can already be regarded as a classic in its field."(Bull.LMS) "Schmidt's work on approximations by algebraic numbers belongs to the deepest and most satisfactory parts of number theory. These notes give the best accessible way to learn the subject. ... this book is highly recommended." (Mededelingen van het Wiskundig Genootschap)
Subjects
Series Statement
- Lecture notes in mathematics ; 785
- Lecture notes in mathematics (Springer-Verlag) ;
- 785.
Other Editions
- Diophantine approximation
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!