Archimede, Theon de Smyrne et 3
Abstract
We know that the algorithm of Theon of Smyrna (70-135 AD) made it possible to highlight fine frames of 2 by rationals. However, this same algorithm also applies to 3 and makes it possible to find the famous Archimedes inequalities. An interesting question is whether this very simple iterative method exposed by Theon was not known to the Greeks before him, notably by Archimedes or his contemporaries. Knowing that Theon of Smyrna had already compiled previous works. Note that this algorithm had also made it possible to open a breach towards the Pell-Fermat equations and continued fractions.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.