Abstract
The well-known simple deduction rule according to which for any distribution of more than n objects to n drawers at least one drawer contains at least two objects, gives rise to a generalization of the Euclidean algorithm, which by investigations due to Dirichlet, Hermite and Minkowski turned out to be the source of important arithmetic laws. In particular it implies a statement on how precisely the number 0 can be at least approximated by a linear combination
Carl Ludwig Siegel, Über einige Anwendungen diophantischer Approximationen, In: “Gesammelte Abhandlungen”, Band I, Springer-Verlag, Berlin-Heidelberg-New York, 1966, 209–266.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Scuola Normale Superiore Pisa
About this chapter
Cite this chapter
Fuchs, C. (2014). On some applications of Diophantine approximations. In: Zannier, U. (eds) On Some Applications of Diophantine Approximations. Publications of the Scuola Normale Superiore, vol 2. Edizioni della Normale, Pisa. https://doi.org/10.1007/978-88-7642-520-2_1
Download citation
DOI: https://doi.org/10.1007/978-88-7642-520-2_1
Publisher Name: Edizioni della Normale, Pisa
Print ISBN: 978-88-7642-519-6
Online ISBN: 978-88-7642-520-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)