×
Yarkan, Serhan; Boyaci, Ali

A unified geometric proof of Aristarchus’ inequality. (English) Zbl 07921349

Math. Mag. 97, No. 3, 293-299 (2024).
Summary: We present a refined, simplified, and unified proof of Aristarchus’ inequality, without resorting to trigonometry, calculus or extended geometric arguments.

MSC:

51M04 Elementary problems in Euclidean geometries
51M16 Inequalities and extremum problems in real or complex geometry
Cite Review PDF
Full Text: DOI

References:

[1] Archimedes of Syracuse. The sand reckoner. In: Heath, T, editor. The works of Archimedes: edited in modern notation with introductory chapters (Cambridge Library Collection - Mathematics). Cambridge: Cambridge University Press; 2009. p. 221-232. DOI: .
[2] Ptolemaei, C.Opera quae exstant omnia-Syntaxis mathematica. (Pars I: Libros I-VI Continens), Cambridge Library Collection - Classics, Heiberg JL, ed. 1898. print publication in2013. DOI: .
[3] Thomas Little Heath. Aristarchus of Samos, the Ancient Copernicus: a history of Greek Astronomy to Aristarchus, together with Aristarchus’s Treatise on the sizes and distances of the Sun and Moon. 1st ed. Oxford: Claredon Press. January 1, 1913. ISBN-10: 9333306315.
[4] EuYu. Proof of Aristarchus’ inequality. Mathematics Stack Exchange, August 31, 2015. (Last accessed on May 10th, 2023). Available from: https://math.stackexchange.com/questions/536253/proof-of-aristarchus-inequality.
[5] Nelsen, RB.Proof without words: Aristarchus’ inequalities. Math Mag. 1993;66(1):65-65. DOI: .
[6] Aristarchus of Samos. De magnitudinibus, et distantiis solis, et lunae, liber. apud Camillum Francischinum, 1572. please see the digital version at DOI: .
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.