Best Rational Approximations
Summary: Euler’s closing principle of the Introductio (§382, attributed to Wallis): the convergents of a continued fraction are the best rational approximations to its value — no fraction with smaller denominator gives a closer approximation. He applies this to two famous problems: the rational approximation of (giving the Archimedean , the Metian , and the cosmically accurate ), and the leap-year calculation for the solar year (giving as the Julian rule and as the Gregorian compromise).
Sources: chapter18 (§382).
Last updated: 2026-05-11
The principle
Euler (§382, attributing the formulation to Wallis): “Our fractions, obtained by this method, have a value so close to the continued fraction from which they come, that there are no other numbers, unless they be larger, which give a closer approximation.”
Modern statement: if is the -th convergent of the simple continued fraction expansion of , then for every rational with that is not itself a convergent of , we have .
The proof uses the three-term recurrence and the telescoping-difference identity: the error of the -th convergent is bounded by , while any non-convergent rational with comparable denominator does worse by an amount controllable from the same recurrence.
Example I — Rational approximations of (§382)
Apply the Euclidean algorithm to . The successive quotients are
and the resulting convergents are
Euler comments on each:
- : “the ratio of the diameter to circumference to be … the most accurate approximation unless larger numbers are used.”
- : the Archimedean ratio (Archimedes’ bound ).
- : the Metian ratio (after the Dutch engineer Adriaan Metius, 1571–1635). Euler notes the error is less than — i.e., better than , accurate to about 7 decimal places. The unusually large next quotient () is why is so good: the next convergent denominator is enormous compared to , so the error at is suppressed by a factor of about .
Convergents alternate above and below , as is true for every continued fraction.
Example II — The solar year and the Gregorian calendar (§382)
The solar year is days, hours, minutes, seconds. Convert the excess over days to a fraction of a day:
Apply the Euclidean algorithm: quotients are
(a finite CF because is rational). The convergents are
Euler reads off each:
- : “about one day in four years” — the Julian rule, instituted by Julius Caesar in 45 BCE. One extra day every years.
- : “more exact, however, is the eight days in 33 years, or 181 days in 747 years.” This is the so-called Persian calendar rule (used in the Jalali calendar).
- : in years the Julian calendar inserts extra days, but the true year requires only . The Gregorian reform of 1582 fixed this by removing three leap days every years (the years divisible by but not ). Euler notes: “in 400 years there are 97 extra days, while the Julian calendar gives 100 extra days. This is the reason that the Gregorian calendar in 400 years converts three years, which would be leap years, into ordinary years.”
Note that is not literally a convergent — but it is a close convergent-like compromise; the actual convergent path through approaches the true ratio while matches to four decimals and uses an arithmetically convenient century-aligned denominator.
Closing line
Euler’s calculation of as the rational approximation behind the Gregorian leap-year rule is the last computation in Book I of the Introductio. The chapter — and the book — ends with:
END OF THE FIRST BOOK.
Related pages
- continued-fraction
- convergents-of-a-continued-fraction
- euclidean-algorithm-continued-fraction — the procedure used to obtain the partial quotients
- periodic-continued-fractions — gives best approximations to quadratic irrationals
- pi — the constant being approximated in Example I
- brouncker-formula — a different (much worse-converging) continued fraction for
- chapter-18-on-continued-fractions