Metraipolis › archive › dc_2d36b76bec45
Diophantine approximation — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Diophantine_approximation
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T12:52:12.897Z
- SHA-256 of the archived text
4a2accbe07911a567097a25ea5fb0fe3ce330e4b194e7674422863845f6fcfac- Stable URL of this page
https://metraipolis.com/documento/dc_2d36b76bec45
How to cite
Diophantine approximation — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Diophantine_approximation (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_2d36b76bec45 (Metraipolis archive dc_2d36b76bec45, sha256 4a2accbe07911a567097a25ea5fb0fe3ce330e4b194e7674422863845f6fcfac)
BibTeX
@misc{dc2d36b76bec45,
title = {Diophantine approximation — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Diophantine_approximation},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_2d36b76bec45; sha256 4a2accbe07911a567097a25ea5fb0fe3ce330e4b194e7674422863845f6fcfac},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Diophantine_approximation. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria. The first problem was to know how well a real number can be approximated by rational numbers. For this problem, a rational number p/q is a "good" approximation of a real number α if the absolute value of the difference between p/q and α may not decrease if p/q is replaced by another rational number with a smaller denominator. This problem was solved during the 18th century by means of simple continued fractions. Knowing the "best" approximations of a given number, the main problem of the field is to find sharp upper and lower bounds of the above difference, expressed as a function of the denominator. It appears that these bounds depend on the nature of the real numbers to be approximated: the lower bound for the approximation of a rational number by another rational number is larger than the lower bound for algebraic numbers, which is itself larger than the lower bound for all real numbers. Thus a real number that may be better approximated than the bound for algebraic numbers is certainly a transcendental number. This knowledge enabled Liouville, in 1844, to produce the first explicit transcendental number. Later, the proofs that π and e are transcendental were obtained by a similar method. Diophantine approximations and transcendental number theory are very close areas that share many theorems and methods. Diophantine approximations also have important applications in the study of Diophantine equations. The 2022 Fields Medal was awarded to James Maynard, in part for his work on Diophantine approximation. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «number theory»). Fonte: Wikipedia in inglese, voce «Diophantine approximation» — https://en.wikipedia.org/wiki/Diophantine_approximation Wikidata Q1227061: «approssimazione dei numeri reali mediante numeri matematici» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1227061 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Diophantine_approximation?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1306115840, consultata il 2026-10-06T11:08:29.541Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 447632f32ff9c4bd0190bbb20d664747eb17af77dff4b13dea01d5c325ee60f2