Euler · part 10 of 2

What Euler Did in His Seventeen Blind Years — E10 Finale

timeobserver137math-companione10eulerhistory-of-mathematics18th-centurynumber-theorycelestial-mechanicslatin-squaresquadratic-reciprocitymersenne-primeslagrange-points

What Euler did in his seventeen blind years

E10 · timeobserver137 video blog edition Authors: Escher (intro/closing/retrospective) + Abel (math sections) + Gauss/Socrates (peer review) Video: E10 The Seventeen Blind Years | 18:10


§Preface: in my own words

This piece is the final installment of the Euler series. My original intention in making the Euler series was to make good on that pure curiosity and thirst for knowledge I had when I was young. I said in E01 that the shock Euler gave me, and the interest in mathematics he gave me, came from that book of Pólya’s, Mathematics and Plausible Reasoning; but the real source of my own interest in mathematics was the elementary geometry I learned in junior high school. Since then it has been like a pure land in my life, and whenever I meet huge upheavals in life I go back to this pure land to satisfy that pure curiosity and thirst for knowledge of my youth.

But what is different from before is that now there is AI, and with AI’s help it can greatly stir up that purity in me; I can do more exploring in less time, and I can also use it to share the joy of this exploration with others. The Euler series is the result of this exploration. I had never made videos or done editing before, nor had I studied Euler in any depth; I even half-understood some of his contributions. Once I had AI, I let them help me learn and explore together, to experience this pure happiness, and they have also helped me gradually walk out of my present low point.

As for this episode specifically: Escher helped me cut the video footage together + wrote the historical narrative sections of the blog (§0 preface / §5 the day of death / §6 cross-episode retrospective); Abel wrote all the derivations of the four sections of serious mathematics in blog §1-§4 + those Manim animations in the video; Gauss checked all the historical facts in the blog + video (E-numbers / dates / sources of quotations); Socrates checked the logical rigor of the mathematical proofs; Euler published the finished product to timeobserver137.cyou. I myself was really only pulling levers in the engine room — deciding the direction, guarding the taste, doing review with them round after round.

Honest disclosure: the text of this blog post was roughly 70% generated by AI agents, but 100% supervised by me + every paragraph reviewed — similar to the relationship between a magazine editor-in-chief and the authors. That is also how I see my collaboration with them.

Neither you reading this nor I know what the future will be like, but I believe that this innocence in my heart will not be lost as time passes, nor disappear with the changes of life; just like Euler’s interest in mathematics, it will accompany me all my life.

If you like what I am doing at the moment, you are welcome to contact me through any of the channels below:

Thank you, too, for reading this far. All the best.


Symbol Preamble (notational conventions)

To save repetition below, the mathematical symbols used throughout this blog post are listed here. Where a section has local extensions, they are declared at the start of that section.

Number sets

N={1,2,3,…},Z={…,−1,0,1,…},Q,R,C\mathbb{N} = \{1, 2, 3, \ldots\}, \quad \mathbb{Z} = \{\ldots, -1, 0, 1, \ldots\}, \quad \mathbb{Q}, \quad \mathbb{R}, \quad \mathbb{C}

Fq\mathbb{F}_q denotes the finite field of order qq (when qq is prime, this is Z/qZ\mathbb{Z}/q\mathbb{Z}).

Vector and scalar conventions

Differential operators

∇=(∂x,∂y,∂z),∇⋅F,∇×F,∂t=∂∂t\nabla = (\partial_x, \partial_y, \partial_z), \quad \nabla \cdot \mathbf{F}, \quad \nabla \times \mathbf{F}, \quad \partial_t = \tfrac{\partial}{\partial t}

Material derivative (advective): DDt=∂t+v⋅∇\dfrac{D}{Dt} = \partial_t + \mathbf{v} \cdot \nabla.

Number theory

Logical markers

Euler-Eneström numbering

Each Euler paper is identified by an E-number (Eneström’s 1910 catalogue). Important references in this article:

§0.1 Preface: May 1766, the border

In May 1766, the 59-year-old Leonhard Euler was packing his bags in Berlin. The 25-year Berlin era was over; the patience between Frederick II (“the Great”) and his one-eyed geometer had run out. In his position as head of the mathematics class of the Berlin Academy, he had written a letter of recommendation, leaving the successor’s position to a young Italian who had sent him a manuscript on the calculus of variations at 19, Joseph-Louis Lagrange (born in Turin in 1736; 30 years old in 1766). Lagrange formally took over the mathematics class of the Berlin Academy in 1766. ([Calinger 2016, Chapter 18])

On the side of the Russian empress Catherine II, she was waiting for him. Since succeeding to the throne in the palace coup of 1762 she had been rebuilding the Russian academy, and Euler was the key candidate for rebuilding the mathematical foundations of the Petersburg Academy of Sciences. The carriage she sent picked up the Euler family at the Russian border. On arrival in Petersburg, the academy had prepared for him an annual salary of 3000 rubles + housing near the court + positions arranged for his children.

After Euler left, Frederick II wrote to d’Alembert to thank him for recommending the successor: « je dois à vos soins et à votre recommandation d’avoir remplacé dans mon Académie un géomètre borgne par un géomètre qui a ses deux yeux, ce qui plaira surtout fort à la classe des anatomistes » (“I owe it to your care and your recommendation that I have replaced, in my Academy, a one-eyed geometer with a geometer who has both his eyes, which will especially please the class of anatomists”). (Frederick to d’Alembert, 26 July 1766, Œuvres de Frédéric le Grand, vol. 24, p. 407. The often-repeated “The one-eyed geometer is gone; I can save some money” is a later retelling; the letter says nothing about saving money.)

But Euler’s right eye had already been blind for 28 years, since a high fever in 1738. On arrival in Petersburg, the only eye he could still use, his left, had also begun to blur. He knew very well what might happen next.

§0.2 The timeline of the blindness

The decline of Euler’s eyesight over his life falls into three stages, which must be stated separately, because they determined the changes in the way he worked:

Stage I (1738-1766): right eye blind, left eye working

In 1738 Euler went through a severe high fever in Petersburg (presumed to be typhus or a similar bacterial infection), and after the fever subsided his right eye was blind. He was 31 at the time. This one-eyed blindness lasted 28 years, during which he completed core results such as the Mechanica (E015-E016), the Introductio in analysin infinitorum (E101-E102), the fluid equations (E258), the theory of the motion of the Moon (E187, 1753), and the polyhedron formula (E230/E231). That is, the most productive 28 years of his career were completed with one eye blind.

Stage II (1766-1771): the left eye also gradually blurring, nearly totally blind

In August-September 1766, in his second month after arriving in Petersburg, Euler again had a severe high fever. After the fever subsided, his remaining left eye also gradually became blurred. For the 5 years from 1766 to 1771 he was in near-total blindness — he could barely make out outlines of light and dark, but could neither read nor write. Most of his output from this period, including the 234 letters popularizing science written for a German princess of Anhalt-Dessau (Lettres à une princesse d’Allemagne, E343), was already entirely done by dictation. ([Calinger 2016, Chapter 19])

Stage III (1771-1783): completely blind

In fact, not long after Euler arrived in Petersburg (1766), a cataract in his left eye was diagnosed. For the following 5 years he continued working in a state of near-total blindness, waiting for an operation. In September 1771, the most famous eye surgeon in Europe at the time, Baron Michael Johann Baptist de Wenzel, came to Petersburg and performed a couching (needling of the cataract) operation on Euler’s left eye. The operation itself was very successful — within a few weeks Euler’s left eye regained some sight, and he could finally read for himself again. But about a month after the operation, the wound became infected. From then on, Euler was completely blind.

For the 12 years from 1771 until his death in 1783, Euler could not write at all, nor read. He relied on three amanuenses (dictation scribes):

Working pattern: 4-6 hours a day. In the morning, an assistant read the previous day’s manuscript aloud to Euler; Euler ran through the complete computation in his head, then dictated revisions and new content. In the evening, the assistant organized it into notes, and the next day read it aloud to Euler again.

§0.3 Output statistics

PeriodStage of blindnessNumber of papersShare of the lifetime 866
1729-1738 (Petersburg I)both eyes working414.7%
1738-1766 (Petersburg I + Berlin)right eye blind, left eye working41948.4%
1766-1783 (Petersburg II)left eye nearly totally blind → completely blind40646.9%

Sources: Eneström’s 1910 catalogue + the Truesdell-Maltese-Bell tabulation. ([Calinger 2016, Appendix A])

Of the two most productive periods (Berlin, 25 years + Petersburg II, 17 years), in the second he could not see at all. 17 years, 400+ papers, 46.9% of his lifetime output.

This number by itself does not explain why. What we are going to walk through next is the how. In these 17 years Euler pushed forward 4 mathematical main lines at the same time:

Each one requires a serious walk through the proof. Let us take them one section at a time.


Next section: §1 — From Newton’s two bodies to Lagrange’s five points — the relay of Euler 1751-1753 and Lagrange 1772


— Escher · §0 INTRO · v0 · 2026-05-26


§1 — The three-body problem + the Lagrange points L1L_1-L5L_5

Author of this section: Abel. Style: textbook form. Equation numbering: (1.k).

Symbol supplement for this section

In addition to the master Symbol Preamble, this section adds the following symbols:

SymbolMeaning
GGNewton’s gravitational constant
m1,m2,m3m_1, m_2, m_3masses of the three bodies (primary, secondary, test particle)
ri\mathbf{r}_iposition vector of mim_i in the inertial frame
r\mathbf{r}position of the test particle in the co-rotating frame
μ=m2/(m1+m2)\mu = m_2/(m_1 + m_2)dimensionless mass parameter
Ω\Omegaangular velocity of the co-rotating frame
UeffU_{\text{eff}}effective potential in the co-rotating frame
L1,L2,L3L_1, L_2, L_3collinear Lagrange points
L4,L5L_4, L_5equilateral Lagrange points
aathe distance between m1m_1 and m2m_2

Throughout this section normalized units are used: length scaled by aa, mass scaled by m1+m2m_1 + m_2, time scaled by 1/Ω1/\Omega — so that G(m1+m2)=a3Ω2=1G(m_1 + m_2) = a^3 \Omega^2 = 1.


1.1. The two-body problem

We start from the integrable case completely solved by Newton in the Principia (1687).

Theorem 1.1 (Kepler–Newton). Let two point masses m1,m2m_1, m_2, under the inverse-square gravitational force

F12=−G m1m2∣r2−r1∣3 (r2−r1)(1.1)\mathbf{F}_{12} = -\frac{G\, m_1 m_2}{|\mathbf{r}_2 - \mathbf{r}_1|^3}\, (\mathbf{r}_2 - \mathbf{r}_1) \tag{1.1}

move relative to each other. Then the relative orbit r(t):=r2(t)−r1(t)\mathbf{r}(t) := \mathbf{r}_2(t) - \mathbf{r}_1(t) lies in a fixed plane, and its trajectory is a conic section with the center of mass at one focus. For a bounded orbit, this conic is an ellipse, with eccentricity e∈[0,1)e \in [0, 1) and semi-latus rectum pp, parametrized as

r(θ)=p1+ecos⁡θ,(1.2)r(\theta) = \frac{p}{1 + e \cos\theta}, \tag{1.2}

where θ\theta is the true anomaly measured from perihelion.

Proof. By Newton’s second law and the law of universal gravitation, the two point masses satisfy

m1r¨1=+Gm1m2r3r,m2r¨2=−Gm1m2r3r,m_1 \ddot{\mathbf{r}}_1 = +\frac{G m_1 m_2}{r^3}\mathbf{r}, \qquad m_2 \ddot{\mathbf{r}}_2 = -\frac{G m_1 m_2}{r^3}\mathbf{r},

where r:=r2−r1\mathbf{r} := \mathbf{r}_2 - \mathbf{r}_1, r:=∣r∣r := |\mathbf{r}|. Subtracting the two equations and rearranging, the relative position r\mathbf{r} satisfies

μrr¨=−Gm1m2r3r,(1.1a)\mu_r \ddot{\mathbf{r}} = -\frac{G m_1 m_2}{r^3}\mathbf{r}, \tag{1.1a}

where the reduced mass is μr:=m1m2/(m1+m2)\mu_r := m_1 m_2 / (m_1 + m_2). (1.1a) is the equation of motion of a single particle of mass μr\mu_r in the central potential V(r)=−Gm1m2/rV(r) = -G m_1 m_2 / r.

Define the angular momentum L:=r×μrr˙\mathbf{L} := \mathbf{r} \times \mu_r \dot{\mathbf{r}} and differentiate with respect to time:

L˙=r˙×μrr˙+r×μrr¨=0+r×(−Gm1m2r3r)=0,\dot{\mathbf{L}} = \dot{\mathbf{r}} \times \mu_r \dot{\mathbf{r}} + \mathbf{r} \times \mu_r \ddot{\mathbf{r}} = \mathbf{0} + \mathbf{r} \times \Bigl(-\frac{G m_1 m_2}{r^3}\mathbf{r}\Bigr) = \mathbf{0},

so L\mathbf{L} is a constant vector. From L⊥r\mathbf{L} \perp \mathbf{r} and L⊥r˙\mathbf{L} \perp \dot{\mathbf{r}} we know that r\mathbf{r} always lies in the fixed plane through the origin with normal L\mathbf{L}, so the orbit is a plane curve.

In this orbital plane take polar coordinates (r,θ)(r, \theta); the velocity decomposes into the radial r˙\dot r and the tangential rθ˙r \dot\theta, so the magnitude of the angular momentum is

L=∣L∣=μrr2θ˙.(1.1b)L = |\mathbf{L}| = \mu_r r^2 \dot\theta. \tag{1.1b}

Similarly one can prove conservation of energy, that is,

E=12μr(r˙2+r2θ˙2)−Gm1m2r=const.(1.1c)E = \tfrac{1}{2}\mu_r(\dot r^2 + r^2 \dot\theta^2) - \frac{G m_1 m_2}{r} = \text{const}. \tag{1.1c}

From (1.1b) solve for θ˙=L/(μrr2)\dot\theta = L/(\mu_r r^2) and substitute into the radial component of (1.1a). Change variables u:=1/ru := 1/r and change the independent variable t↦θt \mapsto \theta: by the chain rule,

r˙=drdθθ˙=−1u2dudθ⋅Lu2μr=−Lμrdudθ,\dot r = \frac{dr}{d\theta}\dot\theta = -\frac{1}{u^2}\frac{du}{d\theta} \cdot \frac{L u^2}{\mu_r} = -\frac{L}{\mu_r}\frac{du}{d\theta}, r¨=−Lμrd2udθ2θ˙=−L2u2μr2d2udθ2.\ddot r = -\frac{L}{\mu_r}\frac{d^2 u}{d\theta^2}\dot\theta = -\frac{L^2 u^2}{\mu_r^2}\frac{d^2 u}{d\theta^2}.

Into the radial equation of motion μr(r¨−rθ˙2)=−Gm1m2/r2\mu_r(\ddot r - r\dot\theta^2) = -G m_1 m_2 / r^2 substitute r=1/ur = 1/u, rθ˙2=L2u3/μr2r\dot\theta^2 = L^2 u^3/\mu_r^2; simplifying gives (the Binet equation)

d2udθ2+u=Gm1m2μrL2.(1.1d)\frac{d^2 u}{d\theta^2} + u = \frac{G m_1 m_2 \mu_r}{L^2}. \tag{1.1d}

Its general solution is

u(θ)=Gm1m2μrL2(1+ecos⁡(θ−θ0)),u(\theta) = \frac{G m_1 m_2 \mu_r}{L^2}\bigl(1 + e \cos(\theta - \theta_0)\bigr),

where e,θ0e, \theta_0 are constants of integration. Take θ0=0\theta_0 = 0 (i.e., measure θ\theta from perihelion); inverting r=1/ur = 1/u gives

r(θ)=p1+ecos⁡θ,p:=L2Gm1m2μr,(1.2 restated)r(\theta) = \frac{p}{1 + e\cos\theta}, \quad p := \frac{L^2}{G m_1 m_2 \mu_r}, \tag{1.2 restated}

that is, the standard form of a conic in polar coordinates, with the focus at the origin. The eccentricity ee determines the type of conic: e=0e = 0 is a circle, 0<e<10 < e < 1 an ellipse, e=1e = 1 a parabola, e>1e > 1 a hyperbola. For a bounded orbit, E<0E < 0, and working back from (1.1c) gives e∈[0,1)e \in [0, 1), so the orbit is an ellipse, that is, (1.2). (QED)

Hence the two-body problem is integrable in closed form: the orbit is completely determined by two constants (p,e)(p, e) plus the orientation angle, and given initial values it can be predicted forever.


Remark 1.1. In the formula r=p/(1+ecos⁡θ)r = p/(1 + e\cos\theta), rr is the distance from the planet to the Sun, varying with the polar angle θ\theta: when θ=0\theta = 0 (perihelion), cos⁡θ=1\cos\theta = 1, the denominator is largest, and rr takes its minimum; when θ=π\theta = \pi (aphelion), cos⁡θ=−1\cos\theta = -1, the denominator is smallest, and rr takes its maximum. The eccentricity ee quantifies how far the ellipse departs from a circle: e=0e = 0 is a perfect circle, e→1e \to 1 an extremely flat ellipse. The Earth’s orbit has e≈0.017e \approx 0.017, Halley’s comet e≈0.967e \approx 0.967. pp controls the overall size of the ellipse.

The two-body problem is therefore integrable in closed form: given initial values, the whole orbit is completely determined by two constants (p,e)(p, e) plus the orientation angle, and can be predicted forever.

1.2. The non-integrability of three bodies

The reason the two-body problem can be solved is that we can find enough conserved quantities to reduce the high-dimensional phase space step by step to an equation in one variable (the Binet equation of the previous section). For three or more bodies, this procedure no longer works — that is the original meaning of “the non-integrability of the three-body problem”.

What does “non-integrable” mean? For nn point masses moving in three-dimensional space, the positions have 3n3n components in total and the velocities 3n3n components in total, so the phase space is 6n6n-dimensional. The conserved quantities classical physics gives us number only the following 1010 in total (called the classical integrals):

Conserved quantityNumberWhat it is
Total energy E=∑i12mi∣r˙i∣2+VtotE = \sum_i \tfrac{1}{2}m_i \vert \dot{\mathbf{r}}_i\vert ^2 + V_{\text{tot}}11total kinetic energy + total potential energy of the system is unchanged
Total linear momentum P=∑imir˙i\mathbf{P} = \sum_i m_i \dot{\mathbf{r}}_i33one each for the three directions x,y,zx, y, z
Total angular momentum L=∑iri×mir˙i\mathbf{L} = \sum_i \mathbf{r}_i \times m_i \dot{\mathbf{r}}_i33one each for the three directions
Center-of-mass position linear in time Rcm(t)=R0+Vcmt\mathbf{R}_{\text{cm}}(t) = \mathbf{R}_0 + \mathbf{V}_{\text{cm}} t33equivalent to conservation of the three initial quantities Rcm(0)\mathbf{R}_{\text{cm}}(0)

In total 1+3+3+3=101 + 3 + 3 + 3 = 10 independent conserved quantities. In the Liouville–Arnold framework of Hamiltonian mechanics (see Arnold 1989, Mathematical Methods of Classical Mechanics, §49), if a symplectic manifold has nn pairs of canonical coordinates and nn conserved quantities in involution (Poisson commuting), then the system is integrable. For two bodies (n=2n = 2, phase space 1212-dimensional, i.e. 66 canonical pairs), the 1010 quantities above plus reduction by rotational symmetry leave enough conserved quantities in involution, reducing it to a quadrature in one variable — integrable.

For three bodies (n=3n = 3, phase space 1818-dimensional, i.e. 99 canonical pairs), the 1010 quantities above, after screening for involutivity, are not enough to cover all the degrees of freedom — even after removing rotational symmetry a multidimensional problem remains, which cannot be reduced to a quadrature in one variable.

A deeper obstacle: Bruns (1887) proved that, apart from the 1010 above, the three-body problem has no additional conserved quantity of algebraic form. Poincaré (1890) further proved that there is no additional conserved quantity analytic in all the canonical coordinates. Painlevé (1898) and Sundman (1912) further pointed out that, even in certain simpler cases, the solution cannot be expressed in closed form by elementary functions, and can at most be given by an extremely slowly converging infinite series (the Sundman series, convergent but unusable in practice).

Summary in one sentence: “the non-integrability of the three-body problem” means — we cannot find enough independent conserved quantities to reduce the system of equations to something that can be solved in closed form.

Practical countermeasure — settle for second best: give up the strongest assumption, “the three bodies are dynamically equally important”. If the third mass is negligible compared with the first two — a satellite, an asteroid, a spacecraft — then its motion does not in turn affect the orbits of the first two; the first two move in ellipses (or, for simplicity, circles) as in the two-body problem, and the third only moves in the gravitational field produced by the first two. This is the restricted three-body problem. Euler studied it in 1751–53 (Theoria motus lunae), and Lagrange in 1772 (Essai sur le problème des trois corps) brought it into its modern form.

Co-rotating frame animation, Sun-Jupiter rotating frame

Animation of the co-rotating frame: the two primaries (orange Sun + gray Jupiter) are fixed on the xx-axis, and the whole coordinate frame rotates about the origin with angular velocity Ω\Omega. The third, test mass m3m_3 moves in the combined gravitational field produced by the two primaries + the centrifugal potential. For a static illustration see fig8 (https://timeobserver137.cyou/content/images/2026/05/fig8_rotating_frame-6.png); of the five Lagrange equilibrium points, L1,L2,L3L_1, L_2, L_3 are collinear, and L4,L5L_4, L_5 form equilateral triangles with the two primaries.

1.3. The restricted three-body problem in the co-rotating frame

Setup: the two primaries m1,m2m_1, m_2 move in circular Keplerian orbits about their common center of mass, with separation aa and angular velocity

Ω=G(m1+m2)a3.(1.4)\Omega = \sqrt{\frac{G(m_1 + m_2)}{a^3}}. \tag{1.4}

Remark 1.2 (derivation of (1.4)). A direct application of Kepler’s third law to a circular two-body orbit. For a circular motion of radius aa by m1m_1 (relative to the center of mass), the centripetal force equals the gravitational force:

m1⋅m2m1+m2 a Ω2=Gm1m2a2.m_1 \cdot \frac{m_2}{m_1+m_2}\, a\, \Omega^2 = \frac{G m_1 m_2}{a^2}.

The m2m1+m2 a\dfrac{m_2}{m_1+m_2}\, a on the left is the distance from m1m_1 to the center of mass (the center of mass lies between m1,m2m_1, m_2, from m2m_2 at a fraction m1/(m1+m2)m_1/(m_1+m_2)). Simplifying gives Ω2=G(m1+m2)/a3\Omega^2 = G(m_1 + m_2)/a^3, and taking the positive root gives (1.4).

The third mass m3≪m1,m2m_3 \ll m_1, m_2 moves in the gravitational field of m1,m2m_1, m_2 without perturbing their orbits. Pass to the co-rotating frame (angular velocity Ω\Omega), in which m1,m2m_1, m_2 are fixed at

r1=(−μ,0,0),r2=(1−μ,0,0),(1.5)\mathbf{r}_1 = (-\mu, 0, 0), \quad \mathbf{r}_2 = (1 - \mu, 0, 0), \tag{1.5}

where μ=m2/(m1+m2)∈(0,1/2]\mu = m_2 / (m_1 + m_2) \in (0, 1/2] is the mass parameter, and we have normalized so that a=1a = 1.

In the co-rotating frame, the equation of motion of r=(x,y,z)\mathbf{r} = (x, y, z) contains centrifugal and Coriolis pseudo-forces (because we have changed into a non-inertial rotating frame). Write ρ1:=∣r−r1∣\rho_1 := |\mathbf{r} - \mathbf{r}_1| (the distance from m3m_3 to m1m_1), ρ2:=∣r−r2∣\rho_2 := |\mathbf{r} - \mathbf{r}_2| (the distance from m3m_3 to m2m_2). The effective potential is

Ueff(x,y,z):=−1−μρ1−μρ2−12(x2+y2).(1.6)U_{\text{eff}}(x, y, z) := -\frac{1 - \mu}{\rho_1} - \frac{\mu}{\rho_2} - \frac{1}{2}(x^2 + y^2). \tag{1.6}

The three terms are respectively: the gravitational potential of m1m_1 (weight 1−μ1-\mu, equal to m1/(m1+m2)m_1/(m_1+m_2)), the gravitational potential of m2m_2 (weight μ\mu), and the centrifugal potential induced by the co-rotating frame, −12Ω2(x2+y2)-\tfrac{1}{2}\Omega^2(x^2+y^2) (after normalization Ω=1\Omega = 1).

Lemma 1.4 (Jacobi integral). In the co-rotating frame, the quantity

Sweep of the zero-velocity curves of the Jacobi integral — as C_J decreases, the accessible region (green) gradually opens up from above L_4/L_5, through L_1/L_2/L_3, to around m_1, m_2. The core visualization of the Hill region.

Sweep of the zero-velocity curves of the Jacobi integral — as CJC_J decreases, the accessible region (green) gradually opens up from above L4/L5L_4/L_5, through L1/L2/L3L_1/L_2/L_3, to around m1,m2m_1, m_2. The core visualization of the Hill region.

CJ:=−2Ueff−∣r˙∣2=2(1−μ)ρ1+2μρ2+(x2+y2)−∣r˙∣2(1.7)C_J := -2 U_{\text{eff}} - |\dot{\mathbf{r}}|^2 = \frac{2(1-\mu)}{\rho_1} + \frac{2\mu}{\rho_2} + (x^2 + y^2) - |\dot{\mathbf{r}}|^2 \tag{1.7}

is conserved along orbits of the restricted three-body problem.

Proof. The equation of motion in the co-rotating frame (including the Coriolis term −2Ω×r˙-2 \boldsymbol{\Omega} \times \dot{\mathbf{r}}):

r¨=−∇Ueff−2 Ω×r˙,Ω=Ωz^.(1.7a)\ddot{\mathbf{r}} = -\nabla U_{\text{eff}} - 2\, \boldsymbol{\Omega} \times \dot{\mathbf{r}}, \quad \boldsymbol{\Omega} = \Omega \hat{\mathbf{z}}. \tag{1.7a}

Take the time derivative of CJC_J, using the chain rule:

C˙J=−2U˙eff−ddt∣r˙∣2=−2(∇Ueff⋅r˙)−2r˙⋅r¨.\dot C_J = -2 \dot U_{\text{eff}} - \frac{d}{dt} |\dot{\mathbf{r}}|^2 = -2 (\nabla U_{\text{eff}} \cdot \dot{\mathbf{r}}) - 2 \dot{\mathbf{r}} \cdot \ddot{\mathbf{r}}.

Substitute the r¨\ddot{\mathbf{r}} of (1.7a):

C˙J=−2(∇Ueff⋅r˙)−2r˙⋅(−∇Ueff−2Ω×r˙).\dot C_J = -2 (\nabla U_{\text{eff}} \cdot \dot{\mathbf{r}}) - 2 \dot{\mathbf{r}} \cdot \bigl(-\nabla U_{\text{eff}} - 2\boldsymbol{\Omega} \times \dot{\mathbf{r}}\bigr).

Expand:

C˙J=−2(∇Ueff⋅r˙)+2(r˙⋅∇Ueff)+4r˙⋅(Ω×r˙).\dot C_J = -2 (\nabla U_{\text{eff}} \cdot \dot{\mathbf{r}}) + 2 (\dot{\mathbf{r}} \cdot \nabla U_{\text{eff}}) + 4 \dot{\mathbf{r}} \cdot (\boldsymbol{\Omega} \times \dot{\mathbf{r}}).

The first two terms cancel; in the third term Ω×r˙\boldsymbol{\Omega} \times \dot{\mathbf{r}} is orthogonal to r˙\dot{\mathbf{r}} (a standard property of the vector cross product), so the inner product is zero. Therefore C˙J=0\dot C_J = 0, that is, CJC_J is conserved. (QED)

The physical meaning of CJC_J: it corresponds to the “effective energy” in the co-rotating frame. In the inertial frame the total energy of the three bodies is not conserved (the restricted assumption forcibly nails m1,m2m_1, m_2 onto circular orbits, which, compared with reality, adds an external “constraint force”), but CJC_J is the only global conserved quantity left — it is the key tool for restricting the range in which the three-body equations can actually be analyzed to a surface of constant value.

The equilibrium points of the co-rotating motion are where the gradient of UeffU_{\text{eff}} is zero. At such a point, at rest in the co-rotating frame, taking r˙=0\dot{\mathbf{r}} = \mathbf{0} in (1.7a) automatically gives r¨=−∇Ueff=0\ddot{\mathbf{r}} = -\nabla U_{\text{eff}} = \mathbf{0}, that is, the test particle stays at rest — this is the physical essence of the “Lagrange equilibrium points”.

1.4. The five equilibrium points

Theorem 1.5 (existence of the five Lagrange equilibrium points). For each μ∈(0,1/2]\mu \in (0, 1/2], the planar gradient condition ∇Ueff(x,y,0)=0\nabla U_{\text{eff}}(x, y, 0) = \mathbf{0} has exactly five solutions:

Contour plot of the effective potential U_{\text{eff}}, showing the 5 critical points L_1-L_5 (μ = 0.05)

Contour plot of the effective potential UeffU_{\text{eff}}, showing the 5 critical points L1L_1-L5L_5 (μ = 0.05) - the three collinear points L1,L2,L3L_1, L_2, L_3 lie on the xx-axis - the two equilateral points L4,L5L_4, L_5 form equilateral triangles with m1,m2m_1, m_2, with coordinates (x,y)=(1/2−μ,±3/2)(x, y) = (1/2 - \mu, \pm \sqrt{3}/2)

Remark 1.3 (explanation of the “planar gradient condition”). The condition ∇Ueff(x,y,0)=0\nabla U_{\text{eff}}(x, y, 0) = \mathbf{0} only considers equilibrium points with z=0z = 0 (i.e., in the plane of m1,m2m_1, m_2). The partial derivative with respect to zz, ∂zUeff=(1−μ)z/ρ13+μz/ρ23\partial_z U_{\text{eff}} = (1-\mu)z/\rho_1^3 + \mu z/\rho_2^3, is automatically zero at z=0z = 0, so z=0z = 0 brings no additional constraint. All five Lagrange solutions lie in the orbital plane of the two primaries; in the region z≠0z \neq 0, ∂zUeff≠0\partial_z U_{\text{eff}} \neq 0, and there are no static equilibrium points.

Proof. By (1.6), the gradient in the plane is

∂xUeff=(1−μ)(x+μ)ρ13+μ(x−1+μ)ρ23−x,(1.8)\partial_x U_{\text{eff}} = \frac{(1-\mu)(x + \mu)}{\rho_1^3} + \frac{\mu(x - 1 + \mu)}{\rho_2^3} - x, \tag{1.8} ∂yUeff=(1−μ) yρ13+μ yρ23−y=y[1−μρ13+μρ23−1].(1.9)\partial_y U_{\text{eff}} = \frac{(1-\mu)\, y}{\rho_1^3} + \frac{\mu\, y}{\rho_2^3} - y = y\left[ \frac{1-\mu}{\rho_1^3} + \frac{\mu}{\rho_2^3} - 1 \right]. \tag{1.9}

Collinear branch (y=0y = 0): equation (1.9) is automatically satisfied. Equation (1.8) becomes

f(x):=(1−μ)(x+μ)∣x+μ∣3+μ(x−1+μ)∣x−1+μ∣3−x=0,(1.10)f(x) := \frac{(1-\mu)(x + \mu)}{|x + \mu|^3} + \frac{\mu(x - 1 + \mu)}{|x - 1 + \mu|^3} - x = 0, \tag{1.10}

Within each interval, after clearing denominators, this is a quintic equation in xx. On the three open intervals (−∞,−μ)(-\infty, -\mu), (−μ,1−μ)(-\mu, 1 - \mu), (1−μ,+∞)(1 - \mu, +\infty), examine ff separately.

Differentiating (1.10) directly,

f′(x)=−2(1−μ)∣x+μ∣3−2μ∣x−1+μ∣3−1<0(1.10a)f'(x) = -\frac{2(1-\mu)}{|x+\mu|^3} - \frac{2\mu}{|x-1+\mu|^3} - 1 < 0 \tag{1.10a}

holds strictly within each interval (the gravitational terms, as inverse cubes, are negative; the centrifugal contribution is −1-1). Hence ff is strictly decreasing on each interval. The limits at the endpoints are respectively: - (−∞,−μ)(-\infty, -\mu): f(x)→+∞f(x) \to +\infty as x→−∞x \to -\infty (the centrifugal −x-x dominates and is positive), f(x)→−∞f(x) \to -\infty as x→−μ−x \to -\mu^- (the gravity from m1m_1 diverges, negative). - (−μ,1−μ)(-\mu, 1-\mu): f(x)→+∞f(x) \to +\infty as x→−μ+x \to -\mu^+ (the sign of gravity flips), f(x)→−∞f(x) \to -\infty as x→(1−μ)−x \to (1-\mu)^-. - (1−μ,+∞)(1-\mu, +\infty): f(x)→+∞f(x) \to +\infty as x→(1−μ)+x \to (1-\mu)^+, f(x)→−∞f(x) \to -\infty as x→+∞x \to +\infty.

By strict monotonicity and the intermediate value theorem, ff has exactly one root in each interval. Write them L3<−μL_3 < -\mu, −μ<L1<1−μ-\mu < L_1 < 1-\mu, L2>1−μL_2 > 1-\mu (modern convention: L1L_1 between the two primaries, L2L_2 beyond the smaller mass, L3L_3 opposite the smaller mass).

Animation illustrating the positions of the three collinear Lagrange equilibrium points

Animation of the order in which the three collinear Lagrange points appear: L1L_1 between the Sun and Jupiter, L2L_2 beyond Jupiter, L3L_3 opposite the Sun. Each point corresponds to the unique zero of equation (1.10) in a different interval.

Triangular branch (y≠0y \neq 0): the square bracket in (1.9) must be zero, that is,

1−μρ13+μρ23=1.(1.10b)\frac{1-\mu}{\rho_1^3} + \frac{\mu}{\rho_2^3} = 1. \tag{1.10b}

Combined with the symmetric constraint that (1.8) imposes on the two gravitational terms, the symmetric solution is ρ1=ρ2=1\rho_1 = \rho_2 = 1 — that is, m3m_3 is at equal distances from the two primaries, exactly equal to the separation of the two primaries. Substituting into (1.10b) gives (1−μ)+μ=1(1-\mu) + \mu = 1 ✓; substituting into (1.8) gives (1−μ)(x+μ)+μ(x−1+μ)−x=x−x=0(1-\mu)(x+\mu) + \mu(x-1+\mu) - x = x - x = 0 ✓. The two solutions are

L4=(12−μ,  +32,  0),L5=(12−μ,  −32,  0).(1.11)L_4 = \left(\tfrac{1}{2} - \mu,\; +\tfrac{\sqrt{3}}{2},\; 0\right), \quad L_5 = \left(\tfrac{1}{2} - \mu,\; -\tfrac{\sqrt{3}}{2},\; 0\right). \tag{1.11}

Each of them forms an equilateral triangle with m1,m2m_1, m_2. As for the argument that this is the unique triangular solution — (1.10b) together with (1.8) gives a system of equations in (ρ1,ρ2)(\rho_1, \rho_2), which over the positive reals can be proved to have only the one pair of roots (1,1)(1, 1) — for the detailed proof see Szebehely 1967, Theory of Orbits, §4.4. (QED)

1.5. Linear stability — the Routh criterion

In the Sun-Jupiter co-rotating frame, the libration orbits of 30 Trojan test particles near L_4 (μ = 0.001, t ∈ [0, 200] rotating frame units). Because μ < μ_R ≈ 0.0385, the particles undergo bounded libration near L_4 rather than escaping — a dynamical demonstration of Routh stability.

In the Sun-Jupiter co-rotating frame, the libration orbits of 30 Trojan test particles near L4L_4 (μ = 0.001, t ∈ [0, 200] rotating frame units). Because μ < μ_R ≈ 0.0385, the particles undergo bounded libration near L4L_4 rather than escaping — a dynamical demonstration of Routh stability.

§1.4 has found five equilibrium points. However, the mere existence of an equilibrium is not enough to guarantee that a spacecraft or celestial body can stay there — the tip of a pencil standing upside down is a mathematical equilibrium point, but any perturbation destabilizes it. So we must further examine how each equilibrium point responds to small perturbations: if the perturbation decays over time or oscillates boundedly, it is called stable; if it diverges exponentially, unstable.

Let r=r∗+ξ\mathbf{r} = \mathbf{r}_* + \boldsymbol{\xi}, where ξ\boldsymbol{\xi} is a small perturbation. Substitute into the co-rotating equation of motion (1.7a) and Taylor-expand ∇Ueff\nabla U_{\text{eff}} at r∗\mathbf{r}_* (the zeroth-order term vanishes, since r∗\mathbf{r}_* is an equilibrium point), keeping up to linear terms, to get

ξ¨−2Ω×ξ˙=−H(r∗) ξ,(1.12)\ddot{\boldsymbol{\xi}} - 2 \boldsymbol{\Omega} \times \dot{\boldsymbol{\xi}} = -H(\mathbf{r}_*)\, \boldsymbol{\xi}, \tag{1.12}

where H:=(∂i∂jUeff)i,j∈{x,y}H := \big(\partial_i \partial_j U_{\text{eff}}\big)_{i,j \in \{x,y\}} is the Hessian matrix of UeffU_{\text{eff}} restricted to the xyxy plane, evaluated at r∗\mathbf{r}_*. Since (1.12) is a system of linear second-order ordinary differential equations with constant coefficients, substituting the exponential trial solution ξ∼eλt\boldsymbol{\xi} \sim e^{\lambda t} gives the characteristic equation

λ4+(Uxx+Uyy+4Ω2) λ2+(UxxUyy−Uxy2)=0,(1.13)\lambda^4 + (U_{xx} + U_{yy} + 4\Omega^2)\, \lambda^2 + (U_{xx} U_{yy} - U_{xy}^2) = 0, \tag{1.13}

where Uxx,Uyy,UxyU_{xx}, U_{yy}, U_{xy} are evaluated at r∗\mathbf{r}_*. (1.13) is a biquadratic equation in λ2\lambda^2, with 44 roots λk\lambda_k in all; the equilibrium point is stable against linear perturbations if and only if all λk\lambda_k have non-positive real parts (the perturbation oscillates or decays, and does not diverge exponentially). By the biquadratic structure of (1.13), this condition is equivalent to both roots in λ2\lambda^2 being negative real numbers.

Collinear L1,L2,L3L_1, L_2, L_3: direct computation (Charlier 1899) gives Uxx<0U_{xx} < 0 and Uyy>0U_{yy} > 0 at each collinear equilibrium point, so the determinant UxxUyy−Uxy2<0U_{xx} U_{yy} - U_{xy}^2 < 0. Equation (1.13) is biquadratic in λ2\lambda^2 with a negative constant term; the two values of λ2\lambda^2 have opposite signs, so there is a positive real λ\lambda. The collinear Lagrange points are linearly unstable for all μ∈(0,1/2]\mu \in (0, 1/2].

Equilateral L4,L5L_4, L_5: we compute the components of the Hessian at L4=(1/2−μ,3/2,0)L_4 = (1/2 - \mu, \sqrt 3/2, 0). Taking second derivatives of (1.6):

Uxx=(1−μ)[ρ12−3(x+μ)2]ρ15+μ[ρ22−3(x−1+μ)2]ρ25−1,U_{xx} = \frac{(1-\mu)\bigl[\rho_1^2 - 3(x+\mu)^2\bigr]}{\rho_1^5} + \frac{\mu\bigl[\rho_2^2 - 3(x-1+\mu)^2\bigr]}{\rho_2^5} - 1, Uyy=(1−μ)[ρ12−3y2]ρ15+μ[ρ22−3y2]ρ25−1,U_{yy} = \frac{(1-\mu)\bigl[\rho_1^2 - 3y^2\bigr]}{\rho_1^5} + \frac{\mu\bigl[\rho_2^2 - 3y^2\bigr]}{\rho_2^5} - 1, Uxy=−3(1−μ)(x+μ) yρ15+−3μ(x−1+μ) yρ25.U_{xy} = \frac{-3(1-\mu)(x+\mu)\, y}{\rho_1^5} + \frac{-3\mu(x-1+\mu)\, y}{\rho_2^5}.

Substitute the coordinates of L4L_4, (x,y)=(1/2−μ,3/2)(x, y) = (1/2 - \mu, \sqrt 3/2), and the equilateral condition ρ1=ρ2=1\rho_1 = \rho_2 = 1; noting x+μ=1/2x + \mu = 1/2, x−1+μ=−1/2x - 1 + \mu = -1/2, y2=3/4y^2 = 3/4, standard simplification gives

Uxx=−34,Uyy=−94,Uxy=±334(1−2μ),U_{xx} = -\tfrac{3}{4}, \quad U_{yy} = -\tfrac{9}{4}, \quad U_{xy} = \pm \tfrac{3\sqrt 3}{4}(1 - 2\mu),

where the sign of UxyU_{xy}, at L4L_4, is taken as −-, and at L5L_5 as ++ (because at L5L_5, y=−3/2y = -\sqrt 3/2). Hence

Uxx+Uyy=−3,UxxUyy−Uxy2=2716−2716(1−2μ)2=2716(1−(1−2μ)2)=274μ(1−μ).(1.14)U_{xx} + U_{yy} = -3, \qquad U_{xx} U_{yy} - U_{xy}^2 = \tfrac{27}{16} - \tfrac{27}{16}(1 - 2\mu)^2 = \tfrac{27}{16}\bigl(1 - (1-2\mu)^2\bigr) = \tfrac{27}{4}\mu(1-\mu). \tag{1.14}

(The key algebraic identity 1−(1−2μ)2=4μ(1−μ)1 - (1 - 2\mu)^2 = 4\mu(1-\mu) — a direct difference-of-squares expansion.) From Ω=1\Omega = 1 (normalization), in (1.13) 4Ω2=44\Omega^2 = 4, so

λ4+(−3+4)λ2+274μ(1−μ)=λ4+λ2+274μ(1−μ)=0.(1.15)\lambda^4 + (-3 + 4)\lambda^2 + \tfrac{27}{4}\mu(1-\mu) = \lambda^4 + \lambda^2 + \tfrac{27}{4}\mu(1-\mu) = 0. \tag{1.15}

Let z:=λ2z := \lambda^2; the quadratic equation z2+z+274μ(1−μ)=0z^2 + z + \tfrac{27}{4}\mu(1-\mu) = 0 has solutions

z=−1±1−27μ(1−μ)2.z = \frac{-1 \pm \sqrt{1 - 27\mu(1-\mu)}}{2}.

For λ\lambda to be purely imaginary (i.e., the perturbation oscillates and does not grow), zz must take two negative real roots, so (a) the discriminant 1−27μ(1−μ)≥01 - 27\mu(1-\mu) \geq 0 (otherwise zz is complex and λ\lambda has a real part); (b) both roots z±z_\pm are negative (by Vieta: z+z−=274μ(1−μ)>0z_+ z_- = \tfrac{27}{4}\mu(1-\mu) > 0, z++z−=−1<0z_+ + z_- = -1 < 0, automatically negative). Hence stable ⟺

27μ(1−μ)<1⟺μ<μR:=12(1−2327)≈0.0385209…(1.16)27\mu(1-\mu) < 1 \quad \Longleftrightarrow \quad \mu < \mu_{\text{R}} := \frac{1}{2}\left(1 - \sqrt{\frac{23}{27}}\right) \approx 0.0385209\ldots \tag{1.16}

Theorem 1.6 (Routh; Adams Prize essay 1872, monograph On the Stability of Motion 1877). The equilateral Lagrange points L4,L5L_4, L_5 are linearly stable if and only if μ<μR≈0.0385\mu < \mu_{\text{R}} \approx 0.0385, where μR=12(1−23/27)\mu_{\text{R}} = \frac{1}{2}(1 - \sqrt{23/27}).

Routh stability region for L4/L5

Visualization of the Routh stability criterion: the position of the curve μ(1−μ)\mu(1-\mu) relative to the threshold 1/271/27. The blue region is stable (L4,L5L_4, L_5 linearly stable), the red region unstable. Three sample systems are marked — Sun-Earth (μ≈3×10−6\mu \approx 3 \times 10^{-6}, deeply stable), Sun-Jupiter (μ≈9.5×10−4\mu \approx 9.5 \times 10^{-4}, stable), Pluto-Charon (μ≈0.117\mu \approx 0.117, unstable, cannot sustain Trojans).

1.6. Worked example — the distance of the Sun-Earth L1L_1

Take m1m_1 = the Sun (symbol ⊙\odot), m2m_2 = the Earth (symbol ⊕\oplus). By the definition in §1.3, the mass parameter μ=m2/(m1+m2)\mu = m_2/(m_1 + m_2) is here written concretely as μ⊕\mu_{\oplus} to indicate that it is the “Sun-Earth coefficient”:

μ⊕=M⊕M⊙+M⊕≈5.972×10241.989×1030≈3.003×10−6.(1.17)\mu_{\oplus} = \frac{M_{\oplus}}{M_{\odot} + M_{\oplus}} \approx \frac{5.972 \times 10^{24}}{1.989 \times 10^{30}} \approx 3.003 \times 10^{-6}. \tag{1.17}

(Since M⊕≪M⊙M_{\oplus} \ll M_{\odot}, the denominator is approximately M⊙M_{\odot}, so μ⊕≈M⊕/M⊙\mu_{\oplus} \approx M_{\oplus}/M_{\odot}.)

The collinear equilibrium point L1L_1 between the Sun and the Earth satisfies (1.10) on the interval (−μ,1−μ)(-\mu, 1 - \mu). Let ξ:=1−μ−x\xi := 1 - \mu - x be the distance of L1L_1 from the Earth toward the Sun (normalized, one unit = 1 AU1\,\text{AU}); substitute x=1−μ−ξx = 1 - \mu - \xi into (1.10); on the interval (−μ,1−μ)(-\mu, 1-\mu), x+μ>0x + \mu > 0 and x−1+μ<0x - 1 + \mu < 0, so ∣x+μ∣=1−ξ,∣x−1+μ∣=ξ|x+\mu| = 1 - \xi, |x-1+\mu| = \xi, and the equation becomes

(1−μ)(1−ξ)2−μξ2−(1−ξ−μ)≈0.(1.18)\frac{(1-\mu)}{(1 - \xi)^2} - \frac{\mu}{\xi^2} - (1 - \xi - \mu) \approx 0. \tag{1.18}

To find the dominant balance, when μ≪1\mu \ll 1 and ξ≪1\xi \ll 1 the terms Taylor-expand (to first order) as follows: - 1−μ(1−ξ)2≈(1−μ)(1+2ξ)≈1+2ξ−μ−2μξ≈1+2ξ−μ\dfrac{1-\mu}{(1-\xi)^2} \approx (1-\mu)(1+2\xi) \approx 1 + 2\xi - \mu - 2\mu\xi \approx 1 + 2\xi - \mu. - −μξ2-\dfrac{\mu}{\xi^2} — the dominant term in the competition between the relative magnitudes of μ\mu and ξ\xi. - −(1−ξ−μ)=−1+ξ+μ-(1-\xi-\mu) = -1 + \xi + \mu.

Combining the three terms, (1.18) becomes

(1+2ξ−μ)−μξ2+(−1+ξ+μ)=3ξ−μξ2+O(μξ)≈0.(1 + 2\xi - \mu) - \frac{\mu}{\xi^2} + (-1 + \xi + \mu) = 3\xi - \frac{\mu}{\xi^2} + O(\mu\xi) \approx 0.

Here 11 and −1-1 cancel, −μ-\mu and +μ+\mu cancel, leaving the gravity-gradient term 2ξ2\xi (from the Taylor expansion of 1/(1−ξ)21/(1-\xi)^2) and the centrifugal position term +ξ+\xi (from, within −(1−ξ−μ)-(1-\xi-\mu), the +ξ+\xi), which combine into 3ξ3\xi. The dominant balance is 3ξ≈μ/ξ23\xi \approx \mu/\xi^2, that is,

ξ3≈μ3.\xi^3 \approx \frac{\mu}{3}.

(The factor 3=3 = gravity-gradient contribution 22 + centrifugal position contribution 11.) Substituting the numbers,

ξL1≈(μ3)1/3=(3.003×10−63)1/3≈0.01001.(1.19)\xi_{L_1} \approx \left(\frac{\mu}{3}\right)^{1/3} = \left(\frac{3.003 \times 10^{-6}}{3}\right)^{1/3} \approx 0.01001. \tag{1.19}

The Earth is 1 AU=1.496×108 km1\,\text{AU} = 1.496 \times 10^8\,\text{km} from the Sun, so L1L_1 is located at approximately

dL1≈0.01001×1.496×108 km≈1.498×106 km,(1.20)d_{L_1} \approx 0.01001 \times 1.496 \times 10^8\,\text{km} \approx 1.498 \times 10^6\,\text{km}, \tag{1.20}

that is, about 1.5 million kilometers from the Earth in the direction of the Sun, matching exactly the halo orbit of the SOHO mission near that point (1995 to the present).

For L2L_2, a similar expansion on (1−μ,∞)(1 - \mu, \infty) gives ξL2≈(μ/3)1/3\xi_{L_2} \approx (\mu/3)^{1/3} (on the side away from the Sun) — the station-keeping orbit of JWST since 2022.

For the Sun-Jupiter system, μJ≈9.5×10−4\mu_{\textrm{J}} \approx 9.5 \times 10^{-4}, which satisfies μJ<μR\mu_{\textrm{J}} < \mu_{\text{R}}, so L4,L5L_4, L_5 are linearly stable — and in fact each of them hosts a considerable number of Trojan asteroids: more than 12,00012{,}000 have been numbered and recorded (including named ones), while extrapolation from the IRAS survey estimates the total number of Jupiter Trojans larger than 1 km at more than 10610^6 (the “Greek camp” at L4L_4 and the “Trojan camp” at L5L_5, named starting with Wolf’s first one, 588 Achilles, in 1906).

1.7. Modern significance

The Lagrange equilibrium points are far from an academic curiosity; they organize a whole set of programs of contemporary space science.

Routh’s criterion μ<1/27\mu < 1/27 (1.16) explains why we can see Trojans at Jupiter, Mars, Neptune, and even the Earth — the two Earth Trojans confirmed so far, the asteroids 2010 TK7_7 (confirmed 2011) and 2020 XL5_5 (confirmed 2021), both lie at the Sun-Earth L4L_4 — while the Pluto–Charon system (μ≈0.117\mu \approx 0.117, beyond the Routh threshold) cannot dynamically sustain Trojans, and so none have ever been observed.

Stability comparison of the L_1 saddle point (red) vs the L_4 equilibrium (green). The initial perturbations are of the same magnitude (position < 0.005 / velocity < 0.002 units), but the particles near L_1 escape within about 30 rotating-frame time units, while the particles near L_4 keep librating — a direct visualization of saddle-point instability vs equilateral stability.

Stability comparison of the L1L_1 saddle point (red) vs the L4L_4 equilibrium (green). The initial perturbations are of the same magnitude (position < 0.005 / velocity < 0.002 units), but the particles near L1L_1 escape within about 30 rotating-frame time units, while the particles near L4L_4 keep librating — a direct visualization of saddle-point instability vs equilateral stability.

The quintic equation Euler wrote down in 1751, refined by Lagrange in 1772 and with its stability determination completed by Routh in 1875, controls in 2026 the orbit of a $1-billion telescope — one of the clearest examples in mathematical physics of formal analysis, acting on a superficially simple equation, accumulating and releasing its power.

— End of §1.


§2 — The Mersenne prime M31M_{31}

Author of this section: Abel. Style: textbook form. Equation numbering: (2.k).

Symbol supplement for this section

This section works over Z\mathbb{Z} and over finite fields Fq\mathbb{F}_q (qq prime). In addition to the master Symbol Preamble, it adds:

SymbolMeaning
MpM_pthe pp-th Mersenne number, Mp:=2p−1M_p := 2^p - 1
ord⁡q(a)\operatorname{ord}_q(a)the multiplicative order of aa modulo qq
q∣nq \mid nqq divides nn
a≡b(modn)a \equiv b \pmod naa and bb leave the same remainder when divided by nn

Unless stated otherwise, p,qp, q both denote odd primes.


2.1. Definition and the 1644 list

Definition 2.1. For a positive integer pp, the pp-th Mersenne number is defined as

Mp:=2p−1.(2.1)M_p := 2^p - 1. \tag{2.1}

If MpM_p is prime, it is called a Mersenne prime.

Proposition 2.2 (Mersenne’s first reduction). If MpM_p is prime, then pp must be prime.

Proof. Suppose to the contrary that p=abp = ab (1<a,b1 < a, b). Let X:=2aX := 2^a; then Mp=2ab−1=Xb−1M_p = 2^{ab} - 1 = X^b - 1. Use the algebraic identity (sum of a geometric series)

Xb−1=(X−1)(Xb−1+Xb−2+⋯+X+1)X^b - 1 = (X - 1)(X^{b-1} + X^{b-2} + \cdots + X + 1)

(substituting X=1X = 1: right side (1−1)⋅b=0(1-1)\cdot b = 0 ✓; X=2X = 2: (2b−1)=1⋅(2b−1+⋯+1)=2b−1(2^b-1) = 1 \cdot (2^{b-1} + \cdots + 1) = 2^b - 1 ✓). Substituting back X=2aX = 2^a:

2ab−1=(2a)b−1=(2a−1) ((2a)b−1+(2a)b−2+⋯+1).(2.2)2^{ab} - 1 = (2^a)^b - 1 = (2^a - 1)\,\bigl( (2^a)^{b-1} + (2^a)^{b-2} + \cdots + 1 \bigr). \tag{2.2}

From 1<a<p1 < a < p, 2a−12^a - 1 is an integer greater than 11; also 2a−1<2ab−12^a - 1 < 2^{ab} - 1 (because a<aba < ab), so 2a−12^a - 1 is a nontrivial factor of MpM_p. MpM_p is composite. (QED)

(Note: (2.2) is not the binomial expansion (1+1)n(1+1)^n, but the geometric-series factorization of the polynomial Xb−1X^b - 1. This is a standard algebraic identity, valid over every commutative ring.)

The converse does not hold — many primes pp give composite MpM_p. In 1644 (Cogitata Physico-Mathematica) Marin Mersenne listed, as those for which he claimed MpM_p is prime, the p≤257p \leq 257:

p∈{2,3,5,7,13,17,19,31,67,127,257}.(2.3)p \in \{2, 3, 5, 7, 13, 17, 19, 31, 67, 127, 257\}. \tag{2.3}

Mersenne’s list contains five errors, discovered one after another between 1903 and 1947: - M67M_{67} and M257M_{257} are in fact composite (Cole 1903 gave the factorization of M67M_{67}; Kraitchik 1922 and Lehmer 1947 gave M257M_{257}). - M61,M89,M107M_{61}, M_{89}, M_{107} are actually prime but were left out (Pervushin 1883 / Powers 1911 / Powers 1914).

The first nontrivial entry that needs verification by hand is M31=2,147,483,647M_{31} = 2{,}147{,}483{,}647 — a ten-digit number, a rather formidable task by trial division. In 1772, completely blind, Euler completed the verification by mental arithmetic and sent the result by letter from Petersburg to Basel to inform Daniel Bernoulli. The argument relies on three layers of sieves that progressively shrink the trial-division space.

2.2. Sieve 1 — Fermat’s little theorem

Lemma 2.3 (Fermat’s little theorem). For any prime qq and, with gcd⁡(a,q)=1\gcd(a, q) = 1, any integer aa,

aq−1≡1(modq).(2.4)a^{q-1} \equiv 1 \pmod{q}. \tag{2.4}

Proof. The multiplicative group (Z/qZ)∗(\mathbb{Z}/q\mathbb{Z})^* has order q−1q - 1. By Lagrange’s theorem from finite group theory, the order of any element divides q−1q - 1, so aq−1≡1a^{q-1} \equiv 1. (QED)

Definition of ord⁡q(a)\operatorname{ord}_q(a): for a prime qq and an integer coprime to qq, aa, the multiplicative order of aa modulo qq is, among those making ak≡1(modq)a^k \equiv 1 \pmod q hold, the smallest positive integer kk, written ord⁡q(a)\operatorname{ord}_q(a). For example: - ord⁡7(2)=?\operatorname{ord}_7(2) = ? Compute 21=22^1 = 2, 22=42^2 = 4, 23=8≡1(mod7)2^3 = 8 \equiv 1 \pmod 7, so ord⁡7(2)=3\operatorname{ord}_7(2) = 3. - ord⁡5(3)=?\operatorname{ord}_5(3) = ? 31=33^1 = 3, 32=9≡43^2 = 9 \equiv 4, 33=12≡23^3 = 12 \equiv 2, 34=6≡1(mod5)3^4 = 6 \equiv 1 \pmod 5, so ord⁡5(3)=4\operatorname{ord}_5(3) = 4.

Key property: if ak≡1(modq)a^k \equiv 1 \pmod q, then ord⁡q(a)∣k\operatorname{ord}_q(a) \mid k (that is, the order of aa must divide any “make aka^k become 11” exponent kk). We will use this property right away.

Lemma 2.4 (modulo a prime factor of MpM_p, the order of 22). Let pp be an odd prime. If qq is a prime factor of MpM_p, then ord⁡q(2)=p\operatorname{ord}_q(2) = p, and hence q≡1(modp)q \equiv 1 \pmod{p}.

Proof. By hypothesis q∣(2p−1)q \mid (2^p - 1), that is, 2p≡1(modq)2^p \equiv 1 \pmod{q}. By the key property of the multiplicative order, ord⁡q(2)∣p\operatorname{ord}_q(2) \mid p. Also pp is prime, so ord⁡q(2)∈{1,p}\operatorname{ord}_q(2) \in \{1, p\}. If ord⁡q(2)=1\operatorname{ord}_q(2) = 1, then 2≡1(modq)2 \equiv 1 \pmod q, that is, q∣1q \mid 1, which is impossible. So ord⁡q(2)=p\operatorname{ord}_q(2) = p.

By Fermat’s little theorem (Lemma 2.3), 2q−1≡1(modq)2^{q-1} \equiv 1 \pmod q, so ord⁡q(2)∣(q−1)\operatorname{ord}_q(2) \mid (q - 1). Substituting ord⁡q(2)=p\operatorname{ord}_q(2) = p gives p∣(q−1)p \mid (q - 1), that is, q≡1(modp)q \equiv 1 \pmod p. (QED)

Remark 2.1. By Lemma 2.4, for MpM_p, every prime factor qq must be of the form kp+1kp + 1. For p=31p = 31, a candidate qq must be of the form 31k+131k + 1; in trial division the candidate set shrinks from all primes to primes of the form 31k+131k + 1, a saving of about a factor of 3030.

Corollary 2.5 (Sieve 1 — applied to p=31p = 31). For M31M_{31}, every prime factor qq satisfies

q≡1(mod31).(2.5)q \equiv 1 \pmod{31}. \tag{2.5}

In trial division one only needs to consider q≤M31≈46,340.95q \leq \sqrt{M_{31}} \approx 46{,}340.95. The unsieved trial-division space contains the 47964796 primes below this bound. Sieve 1 requires q∈{63,125,187,249,…}q \in \{63, 125, 187, 249, \ldots\} (the arithmetic progression with common difference 3131 starting from 11); intersected with the primes, the trial-division candidates shrink to about 4796/30≈1604796 / 30 \approx 160 — already a saving of a factor of 3030.

In fact it can be made tighter still. Lemma 2.4 can be strengthened to q≡1(mod2p)q \equiv 1 \pmod{2p}, using that qq is odd: q−1q - 1 is even, and p∣(q−1)p \mid (q-1) with pp odd implies 2p∣(q−1)2p \mid (q-1).

Corollary 2.6 (Sieve 1, strengthened). For M31M_{31}, every prime factor qq satisfies q≡1(mod62)q \equiv 1 \pmod{62}.

This cuts the number of candidates from the previous step roughly in half again.

2.3. Sieve 2 — the quadratic reciprocity refinement

The second layer of sieve narrows the range of candidates further. The key observation: from 2p≡1(modq)2^p \equiv 1 \pmod q one can deduce that ”22 is a quadratic residue modulo qq” — that is, in Fq\mathbb{F}_q there is some element whose square equals 22. This property lets us use the classical law of quadratic reciprocity to restrict qq further to a few special congruence classes.

Lemma 2.7. Let pp be an odd prime and qq a prime factor of MpM_p; then (2q)=+1\left(\dfrac{2}{q}\right) = +1.

Proof. Let k:=(p+1)/2k := (p + 1)/2. Since pp is odd, kk is a positive integer. Compute

(2k)2=2p+1=2⋅2p≡2(modq)(2.6)\left( 2^k \right)^2 = 2^{p+1} = 2 \cdot 2^p \equiv 2 \pmod{q} \tag{2.6}

where we have used 2p≡1(modq)2^p \equiv 1 \pmod q. Equation (2.6) shows that 22 is, in Fq\mathbb{F}_q, the square of 2k2^k, so 22 is a quadratic residue. (QED)

Theorem 2.8 (the second supplementary law of quadratic reciprocity). For an odd prime qq,

(2q)=(−1)(q2−1)/8={+1q≡±1(mod8)−1q≡±3(mod8)(2.7)\left(\dfrac{2}{q}\right) = (-1)^{(q^2 - 1)/8} = \begin{cases} +1 & q \equiv \pm 1 \pmod 8 \\ -1 & q \equiv \pm 3 \pmod 8 \end{cases} \tag{2.7}

(The proof is deferred to §4 of this blog post, where quadratic reciprocity is treated systematically.)

Corollary 2.9 (Sieve 2, strengthened). For M31M_{31}, every prime factor qq satisfies q≡±1(mod8)q \equiv \pm 1 \pmod 8.

2.4. The combined sieve

Theorem 2.10 (Euler’s combined sieve for p=31p = 31). For M31M_{31}, every prime factor qq satisfies simultaneously the congruences

q≡1(mod62),q≡±1(mod8).(2.8)q \equiv 1 \pmod{62}, \quad q \equiv \pm 1 \pmod{8}. \tag{2.8}

By the Chinese remainder theorem (CRT), this is equivalent to

q≡1(mod248)orq≡63(mod248).(2.9)q \equiv 1 \pmod{248} \quad\text{or}\quad q \equiv 63 \pmod{248}. \tag{2.9}

Proof. Combine Corollaries 2.6 and 2.9. The moduli 62=2⋅3162 = 2 \cdot 31 and 8=238 = 2^3 have gcd⁡(62,8)=2\gcd(62, 8) = 2, lcm⁡(62,8)=248\operatorname{lcm}(62, 8) = 248.

The Chinese remainder theorem (CRT) in brief: given two coprime moduli m1,m2m_1, m_2, the system of congruences {x≡a1(modm1),  x≡a2(modm2)}\{x \equiv a_1 \pmod{m_1},\; x \equiv a_2 \pmod{m_2}\} has a unique solution modulo m1m2m_1 m_2. Here our m1=62,m2=8m_1 = 62, m_2 = 8 are not coprime (gcd⁡=2\gcd = 2), but if a1,a2a_1, a_2 agree at the common factor 22 (here a1=1a_1 = 1 and a2∈{1,7}a_2 \in \{1, 7\} are all odd), there is still a unique solution modulo lcm⁡(62,8)=248\operatorname{lcm}(62, 8) = 248. CRT lets us merge two restrictions, modulo 6262 and modulo 88 respectively, into one unified restriction modulo 248248.

The two congruence conditions, modulo 6262 (q≡1q \equiv 1) and modulo 88 (q≡1q \equiv 1 or q≡7q \equiv 7), are compatible, and together give two residue classes modulo 248248: q≡1q \equiv 1 or q≡63(mod248)q \equiv 63 \pmod{248}. (Check: 63 mod 62=163 \bmod 62 = 1 ✓, 63 mod 8=7≡−163 \bmod 8 = 7 \equiv -1 ✓.) (QED)

Estimating the number of candidates: among the residue classes modulo 248248, all φ(248)=120\varphi(248) = 120 of those coprime to 248248, we use only 22 (namely class 11 and class 6363). By Dirichlet’s theorem on the distribution of primes in arithmetic progressions, the primes are evenly distributed among the φ(n)\varphi(n) coprime residue classes. Therefore the number of primes in [1,M31][1, \sqrt{M_{31}}] falling into these 22 classes is approximately:

#{q prime,  q<46341,  q≡1 or 63(mod248)}≈2φ(248)⋅π(46341)=2120⋅4796≈80.(2.10)\#\{q \text{ prime},\; q < 46341,\; q \equiv 1\text{ or }63 \pmod{248}\} \approx \frac{2}{\varphi(248)} \cdot \pi(46341) = \frac{2}{120} \cdot 4796 \approx 80. \tag{2.10}

where π(46341)≈4796\pi(46341) \approx 4796 is the total number of primes ≤46341\leq 46341 (by the prime number theorem π(x)∼x/ln⁡x\pi(x) \sim x/\ln x; here obtained directly from a table).

Direct enumeration (see the verification code below) gives exactly 84 candidate primes — in agreement with the heuristic estimate of 8080 above (the difference is within the random fluctuation of a small sample).

Euler 1772 — sieving the candidate factors of M_{31}: 4810 → 240 → 84 candidates

Euler 1772 — sieving the candidate factors of M31M_{31}: 4810 → 240 → 84 candidates

2.5. Trial division by hand

What remains is the unavoidable work: divide 2,147,483,6472{,}147{,}483{,}647 by each surviving candidate qq, verifying one by one that the remainder is nonzero. The candidate list after sieving by Filter 1 + Filter 2 (in ascending order) begins with

{311,559,1303,1551,1861,…}(2.11)\{311, 559, 1303, 1551, 1861, \ldots\} \tag{2.11}

(each entry a prime ≡1\equiv 1 or 63(mod248)63 \pmod{248}, with upper bound 46,34146{,}341).

Remark 2.2 (Euler’s mental-arithmetic procedure). With no calculator, no pen-and-paper cross-checking, and completely blind, Euler had to complete by mental arithmetic a total of 84 divisibility tests of the 10-digit integer (namely 2,147,483,6472{,}147{,}483{,}647) by candidate divisors qq of at most 5 digits (q≤46341q \leq 46341) (that is, deciding “whether 2,147,483,647÷q2{,}147{,}483{,}647 \div q divides exactly”). In practice it can be simplified with Fermat-style arithmetic tricks: modulo qq, computing 2312^{31} step by step is far more efficient than direct division. The intermediate results were recorded on paper by the scribes (most likely Nicolaus Fuss and his son Johann Albrecht) for checking. All 84 tests took several weeks, and Euler sent the conclusion by letter from Petersburg to Basel, informing Daniel Bernoulli. Theorem 2.11 is the result obtained.

Theorem 2.11 (Euler 1772). M31=2,147,483,647M_{31} = 2{,}147{,}483{,}647 is prime.

Proof (modern verification). The intersection of (2.9) with [2,46340][2, 46340] gives a finite set of primes Q31\mathcal{Q}_{31}. Direct computation (see the Python code below) confirms ∣Q31∣=84|\mathcal{Q}_{31}| = 84. Using each element of Q31\mathcal{Q}_{31} to trial-divide M31M_{31}, the remainder is nonzero every time. So M31M_{31} has no prime factor in the range ≤M31\leq \sqrt{M_{31}}, and hence no prime factor at all (other than itself), so it is prime. (QED)

# Verification of M_31 primality using Euler's filter.
from sympy import isprime, primerange

p, M31 = 31, (1 << 31) - 1   # 2_147_483_647
assert M31 == 2_147_483_647

# Candidate set: primes q <= sqrt(M_31) with q == 1 or 63 (mod 248).
limit = int(M31 ** 0.5) + 1                      # 46341
candidates = [q for q in primerange(3, limit)
              if q % 248 in (1, 63)]
print(f"Surviving candidates: {len(candidates)}")  # 84

# Trial division.
for q in candidates:
    assert M31 % q != 0, f"M_31 has a divisor: {q}"
assert isprime(M31)
print("M_31 is prime ✓")

In 2026 this code block takes only milliseconds to run; in 1772, by mental arithmetic and without pen-and-paper cross-checking (Euler had been completely blind since late 1771 — the infection after Wenzel’s cataract operation in September 1771 set in within months), this work took several weeks. The result held the record as the largest known Mersenne prime for one hundred and four years — until Édouard Lucas in 1876 verified M127M_{127} with the recurrence method now called the Lucas–Lehmer test.

2.6. Modern significance

Mersenne primes are today a main target of distributed computational number theory.

The sieve Euler used in 1772 — Fermat’s little theorem plus the quadratic residue refinement — still survives in 2026 in the form of the trial-division pre-pass, sieving out candidate divisors before calling the far more expensive Lucas–Lehmer test. Euler’s pen-and-paper-plus-brain algorithm, two and a half centuries later, has become the first stage of a global distributed pipeline.

— End of §2.


§3 — Latin squares + the 36 officers problem

Author of this section: Abel. Style: textbook form. Equation numbering: (3.k).

Symbol supplement for this section

This section works over Z\mathbb{Z}, Fq\mathbb{F}_q, and the finite index set [n]:={1,2,…,n}[n] := \{1, 2, \ldots, n\}. In addition to the master Symbol Preamble, it adds:

SymbolMeaning
[n][n]{1,2,…,n}\{1, 2, \ldots, n\}
L:[n]×[n]→[n]L : [n] \times [n] \to [n]Latin square function (entries L(i,j)L(i, j))
L1⊥L2L_1 \perp L_2L1L_1 and L2L_2 are orthogonal
Fq\mathbb{F}_qthe finite field of order qq (qq a prime power)
Fq∗\mathbb{F}_q^*the nonzero elements of Fq\mathbb{F}_q
OLS⁡(n)\operatorname{OLS}(n)the maximum size of a set of mutually orthogonal Latin squares of order nn

3.1. Definition and the 36 officers problem

Definition 3.1. A Latin square of order nn is a function L:[n]×[n]→[n]L : [n] \times [n] \to [n] such that for each row index ii, the restriction L(i,⋅):[n]→[n]L(i, \cdot) : [n] \to [n] is a bijection; likewise, for each column index jj, L(⋅,j):[n]→[n]L(\cdot, j) : [n] \to [n] is also a bijection.

Equivalently, an n×nn \times n array filled with nn symbols, such that each symbol appears exactly once in each row and each column. Sudoku is a Latin square of order 9 plus one additional constraint: the standard 9×99 \times 9 Sudoku requires not only that 11 to 99 appear once each in every row and column (i.e., the Latin square condition), but also that the whole grid be cut into 99 non-overlapping 3×33 \times 3 sub-squares, each of which also contains 11 to 99 once each. Sudoku grids are a proper subset of Latin squares — every Sudoku is a Latin square of order 9, but the vast majority of Latin squares of order 9 are not Sudokus. Russell-Jarvis (2005) counted 6,670,903,752,021,072,936,960≈6.67×10216{,}670{,}903{,}752{,}021{,}072{,}936{,}960 \approx 6.67 \times 10^{21} distinct Sudokus, while McKay-Wanless (2005) counted ≈5.52×1027\approx 5.52 \times 10^{27} Latin squares of order 9 in all — so Sudokus make up about 6.67×10215.52×1027≈1.2×10−6\dfrac{6.67 \times 10^{21}}{5.52 \times 10^{27}} \approx 1.2 \times 10^{-6} (about one in a million) of the Latin squares of order 9.

Sudoku vs plain Latin square comparison

Left: an ordinary Latin square of order 9 (no 3×3 sub-square constraint). Right: a standard Sudoku, with the 3×3 sub-squares marked by bold ochre borders — Sudoku = Latin square + an extra sub-square constraint.

Definition 3.2. Two order-nn Latin squares L1,L2L_1, L_2 are called orthogonal, written L1⊥L2L_1 \perp L_2, if the joint entry map

ΦL1,L2:[n]×[n]→[n]×[n],(i,j)↦(L1(i,j),L2(i,j))(3.1)\Phi_{L_1, L_2} : [n] \times [n] \to [n] \times [n], \quad (i, j) \mapsto (L_1(i, j), L_2(i, j)) \tag{3.1}

is a bijection. Equivalently, all n2n^2 ordered pairs (L1(i,j),L2(i,j))(L_1(i, j), L_2(i, j)) are mutually distinct.

Remark 3.1. Regard L1,L2L_1, L_2 as two n×nn \times n grids; at the same position (i,j)(i, j) each of the two grids has a symbol, and together they form an ordered pair (a,b)(a, b). Orthogonality means: going over the whole square, the n2n^2 ordered pairs (a,b)(a, b) cover each combination in {1,…,n}2\{1, \ldots, n\}^2 exactly once. In the 36 officers case with n=6n = 6, the first square is filled with regiment numbers (6 regiments), the second with ranks (6 ranks), and orthogonality is equivalent to all 36=6×636 = 6 \times 6 (regiment, rank) pairings appearing once each, which is exactly the requirement of Euler’s original problem.

Euler’s problem of 1779. Arrange 36 officers in a 6×66 \times 6 square so that the 6 regiments and the 6 ranks each appear once in every row and every column, and all 36 (regiment, rank) pairings are mutually distinct. In the language of Definition 3.2: find a pair of orthogonal Latin squares of order 6, L1⊥L2L_1 \perp L_2. Euler conjectured that this is impossible — more generally, that for no n≡2(mod4)n \equiv 2 \pmod{4} does L1⊥L2L_1 \perp L_2 exist.

The problem was published in Recherches sur une nouvelle espèce de quarrés magiques (Eneström catalogue number E530), submitted to the Petersburg Academy of Sciences on March 8, 1779, when Euler was 72 and already completely blind.

3.2. The construction for prime order — the finite field recipe

Lemma 3.3 (existence of OLS pairs of prime order). Let pp be a prime, and define

La(i,j):=i+aj(modp)(3.2)L_a(i, j) := i + a j \pmod{p} \tag{3.2}

where a∈Fp∗={1,2,…,p−1}a \in \mathbb{F}_p^* = \{1, 2, \ldots, p-1\}, and row and column indices are taken from Fp={0,1,…,p−1}\mathbb{F}_p = \{0, 1, \ldots, p-1\}. Then: 1. Each LaL_a is a Latin square. 2. For distinct a,b∈Fp∗a, b \in \mathbb{F}_p^*, La⊥LbL_a \perp L_b.

Proof. (1) Fix row ii; La(i,j)=i+ajL_a(i, j) = i + aj as a function of jj is a bijection if and only if multiplication by aa is a bijection on Fp\mathbb{F}_p; this follows from a≠0a \neq 0. The column direction is the same.

(2) Suppose to the contrary that LaL_a and LbL_b are not orthogonal: there exist distinct pairs (i,j)≠(i′,j′)(i, j) \neq (i', j') satisfying

(i+aj,i+bj)≡(i′+aj′,i′+bj′)(modp).(3.3)(i + aj, i + bj) \equiv (i' + a j', i' + b j') \pmod{p}. \tag{3.3}

Subtracting the two coordinates,

(i−i′)+a(j−j′)≡0,(i−i′)+b(j−j′)≡0(modp),(i - i') + a(j - j') \equiv 0, \quad (i - i') + b(j - j') \equiv 0 \pmod{p},

so (a−b)(j−j′)≡0(modp)(a - b)(j - j') \equiv 0 \pmod p. Since a≠ba \neq b in Fp∗\mathbb{F}_p^*, a−b≠0a - b \neq 0, so j≡j′(modp)j \equiv j' \pmod p, that is, j=j′j = j'. Substituting back gives i=i′i = i', contradicting (i,j)≠(i′,j′)(i, j) \neq (i', j'). (QED)

Corollary 3.4. For a prime pp, there exists a pair of orthogonal Latin squares of order pp. Moreover, the construction {La:a∈Fp∗}\{L_a : a \in \mathbb{F}_p^*\} gives p−1p - 1 pairwise orthogonal Latin squares, which is the largest possible number (the upper bound OLS⁡(n)≤n−1\operatorname{OLS}(n) \leq n - 1 for any n≥2n \geq 2 is a classical result; see Bose 1938 or Dénes–Keedwell 1974 §5.2).

Modular OLS construction for p=5

Visualization of Lemma 3.3 for p=5p = 5. Left: L1(i,j)=i+j(mod5)L_1(i,j) = i + j \pmod 5. Middle: L2(i,j)=i+2j(mod5)L_2(i,j) = i + 2j \pmod 5. Right: the superposition (L1,L2)(L_1, L_2); all 2525 pairs (a,b)(a, b) are distinct ⇒L1⊥L2\Rightarrow L_1 \perp L_2.

3.3. Generalizing to prime powers and coprime composites

The finite-field construction generalizes from prime order n=pn = p to prime-power order n=pkn = p^k simply by replacing Fp\mathbb{F}_p with Fpk\mathbb{F}_{p^k}. For composite n=m1m2n = m_1 m_2 with gcd⁡(m1,m2)=1\gcd(m_1, m_2) = 1, MacNeish (1922) proved that OLS pairs can be combined: if orders m1m_1 and m2m_2 each have an OLS pair, then by the direct product an OLS pair of order m1m2m_1 m_2 also exists.

Theorem 3.5 (MacNeish 1922 — the direct-product construction). Let n=p1a1p2a2⋯pkakn = p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k} be the prime factorization of nn. Define

N(n):=min⁡i(piai−1).(3.4)\mathcal{N}(n) := \min_{i} \bigl( p_i^{a_i} - 1 \bigr). \tag{3.4}

Then there exist N(n)\mathcal{N}(n) pairwise orthogonal Latin squares of order nn. In particular, OLS⁡(n)≥N(n)\operatorname{OLS}(n) \geq \mathcal{N}(n).

Proof sketch. Let n=p1a1p2a2⋯pkakn = p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k}. By the Chinese remainder theorem there is a bijection [n]≅∏i[piai][n] \cong \prod_i [p_i^{a_i}], that is, each x∈[n]x \in [n] corresponds to a tuple of prime-power components (x1,…,xk)(x_1, \ldots, x_k), xi∈[piai]x_i \in [p_i^{a_i}].

For each prime-power order piaip_i^{a_i}, by the generalization of Lemma 3.3 to Fpiai\mathbb{F}_{p_i^{a_i}}, there exists a family of piai−1p_i^{a_i} - 1 pairwise orthogonal Latin squares {La(i):a∈Fpiai∗}\{L^{(i)}_a : a \in \mathbb{F}_{p_i^{a_i}}^*\}. Taking the minimum of the upper limits over all factors gives N(n)=min⁡i(piai−1)\mathcal{N}(n) = \min_i (p_i^{a_i} - 1) commonly usable parameters.

Take N(n)\mathcal{N}(n) parameter tuples a=(a1,…,ak)∈∏iFpiai∗\mathbf{a} = (a_1, \ldots, a_k) \in \prod_i \mathbb{F}_{p_i^{a_i}}^* (in each tuple, each component takes a different element of Fpiai∗\mathbb{F}_{p_i^{a_i}}^*), and define the product Latin square

La(i,j):=(La1(1)(i1,j1),…,Lak(k)(ik,jk))∈∏i[piai]≅[n].L_{\mathbf{a}}(\mathbf{i}, \mathbf{j}) := \bigl(L^{(1)}_{a_1}(i_1, j_1), \ldots, L^{(k)}_{a_k}(i_k, j_k)\bigr) \in \prod_i [p_i^{a_i}] \cong [n].

Let a≠b\mathbf{a} \neq \mathbf{b}; then there is at least some component ii with ai≠bia_i \neq b_i. By the orthogonality of each factor in Lemma 3.3, Lai(i)⊥Lbi(i)L^{(i)}_{a_i} \perp L^{(i)}_{b_i}, and hence La⊥LbL_{\mathbf{a}} \perp L_{\mathbf{b}} (the other components are free). So we get N(n)\mathcal{N}(n) pairwise orthogonal Latin squares. (QED)

Corollary 3.6. If nn is not of the form 4k+24k + 2, that is, n≢2(mod4)n \not\equiv 2 \pmod 4, then N(n)≥2\mathcal{N}(n) \geq 2, so an OLS pair of order nn exists.

Proof. If n≢2(mod4)n \not\equiv 2 \pmod 4, the factorization n=p1a1⋯n = p_1^{a_1} \cdots contains neither a lone 22 (the case n=2n = 2) nor a factor of the form 2⋅m2 \cdot m with mm odd (that would force n≡2(mod4)n \equiv 2 \pmod 4). So every piai−1≥2p_i^{a_i} - 1 \geq 2, and hence N(n)≥2\mathcal{N}(n) \geq 2. (QED)

The open cases MacNeish left are exactly n∈{2,6,10,14,18,…}n \in \{2, 6, 10, 14, 18, \ldots\} — that is, the singly-even orders. Euler’s conjecture extends the already proved impossibility for n=2n = 2 to all singly-even orders.

3.4. Euler’s conjecture and early verification

Theorem 3.7 (n=2n = 2 is impossible). There is no OLS pair of order 22.

Proof. Up to a relabeling, there are only two Latin squares of order 2:

L=(1221),L′=(2112),(3.5)L = \begin{pmatrix} 1 & 2 \\ 2 & 1 \end{pmatrix}, \quad L' = \begin{pmatrix} 2 & 1 \\ 1 & 2 \end{pmatrix}, \tag{3.5}

where L′L' is a row permutation of LL. For any choice of L1,L2∈{L,L′}L_1, L_2 \in \{L, L'\}, the image of the joint map Φ\Phi contains at most 22 elements (rather than the full 4=224 = 2^2): when L1=L2L_1 = L_2, Φ(i,j)=(L1(i,j),L1(i,j))\Phi(i,j) = (L_1(i,j), L_1(i,j)) always falls on the diagonal pairs {(1,1),(2,2)}\{(1,1), (2,2)\}; when L1≠L2L_1 \neq L_2, Φ(i,j)\Phi(i,j) always falls on the anti-diagonal pairs {(1,2),(2,1)}\{(1,2), (2,1)\}. Neither is the full {1,2}2\{1, 2\}^2, so there is no OLS pair. (QED)

Euler’s conjecture (1779). For any n≡2(mod4)n \equiv 2 \pmod{4}, there is no OLS pair of order nn.

This conjecture stood for 178 years. The first nontrivial confirmation came from Gaston Tarry (1900) — through an exhaustive search not aided by computers, he proved that the conjecture holds for n=6n = 6.

Theorem 3.8 (Tarry 1900). There is no OLS pair of order 66.

Proof sketch. Up to equivalence under row and column permutations, Tarry enumerated all 812,851,200812{,}851{,}200 Latin squares of order 6 (equivalently, 9,4089{,}408 reduced Latin squares of order 6). For each one, he tested by an exhaustive but finite search whether an orthogonal mate exists. No OLS pair was found. (QED)

Tarry’s 1900 proof closed the subcase n=6n = 6. The full conjecture remained open for n=10,14,18,…n = 10, 14, 18, \ldots until the end of the 1950s.

3.5. The reversal — Bose, Shrikhande, Parker (1959–1960)

Illustration of the Bose-Shrikhande-Parker (1959-60) n=10 orthogonal Latin square pair

Illustration of the Bose-Shrikhande-Parker (1959-60) n=10n=10 orthogonal Latin square pair

The breakthrough came from three closely spaced papers:

These three were therefore called “Euler’s spoilers” — in about 18 months they successively overturned a conjecture that had stood for 178 years.

Theorem 3.9 (Bose–Shrikhande–Parker 1960 — the final answer). An OLS pair of order nn exists if and only if n∈{1}∪{3,4,5}∪{n≥7}n \in \{1\} \cup \{3, 4, 5\} \cup \{n \geq 7\}, that is, except for n=2n = 2 and n=6n = 6, it exists for all positive integers nn.

Proof outline. For the “if” direction, three cases are discussed: when nn is a prime or a prime power and n≥3n \geq 3, Lemma 3.3 (the prime-power generalization) directly gives n−1n-1 pairwise orthogonal Latin squares, which naturally contain an OLS pair; when nn is not a prime power but n≢2(mod4)n \not\equiv 2 \pmod 4, from the N(n)≥2\mathcal{N}(n) \geq 2 of Corollary 3.6 and MacNeish (Theorem 3.5) we know that an OLS pair exists; when n≡2(mod4)n \equiv 2 \pmod 4 and n≥10n \geq 10, the BIBD-based construction of Bose–Shrikhande–Parker (Lemma 3.10) gives an OLS pair.

The “only if” direction is Theorem 3.7 (n=2n = 2) and Theorem 3.8 (n=6n = 6). (QED)

The third part is a new deep result. We sketch its structural idea.

Lemma 3.10 (construction based on BIBDs, sketch). Let v,k,λv, k, \lambda be positive integers, and suppose there exists a (v,k,λ)(v, k, \lambda)-balanced incomplete block design (BIBD), that is, from a vv-point set, a collection of kk-subsets (called “blocks”), B\mathcal{B}, such that every pair of points falls into exactly λ\lambda blocks. If further parameter conditions hold (resolvability, transversal structure), then from B\mathcal{B} an OLS pair of order vv can be constructed.

The concrete construction for n=10n = 10 uses a resolvable (10,4,λ)(10, 4, \lambda) pseudo-design. The construction is constructive but combinatorially rather intricate; modern treatments (Lindner–Rodger 2008 §4.2; Stinson 2003 §6.4) take 6–8 pages to develop it.

3.6. Worked example — constructing an OLS pair for n=5n = 5

Construct an OLS pair of order 5, L1⊥L2L_1 \perp L_2, directly from Lemma 3.3. Take a=1a = 1 and a=2a = 2:

L1(i,j)=i+j(mod5),L2(i,j)=i+2j(mod5).(3.6)L_1(i, j) = i + j \pmod 5, \qquad L_2(i, j) = i + 2j \pmod 5. \tag{3.6}

Row and column indices are taken from {0,1,2,3,4}\{0, 1, 2, 3, 4\} (the entries are also in {0,1,2,3,4}\{0, 1, 2, 3, 4\}):

L1=(0123412340234013401240123),L2=(0241313024241303024141302).(3.7)L_1 = \begin{pmatrix} 0 & 1 & 2 & 3 & 4 \\ 1 & 2 & 3 & 4 & 0 \\ 2 & 3 & 4 & 0 & 1 \\ 3 & 4 & 0 & 1 & 2 \\ 4 & 0 & 1 & 2 & 3 \end{pmatrix}, \quad L_2 = \begin{pmatrix} 0 & 2 & 4 & 1 & 3 \\ 1 & 3 & 0 & 2 & 4 \\ 2 & 4 & 1 & 3 & 0 \\ 3 & 0 & 2 & 4 & 1 \\ 4 & 1 & 3 & 0 & 2 \end{pmatrix}. \tag{3.7}

The superposition Φ(i,j)=(L1(i,j),L2(i,j))\Phi(i, j) = (L_1(i, j), L_2(i, j)) takes the values

Φ=((0,0)(1,2)(2,4)(3,1)(4,3)(1,1)(2,3)(3,0)(4,2)(0,4)(2,2)(3,4)(4,1)(0,3)(1,0)(3,3)(4,0)(0,2)(1,4)(2,1)(4,4)(0,1)(1,3)(2,0)(3,2))(3.8)\Phi = \begin{pmatrix} (0,0) & (1,2) & (2,4) & (3,1) & (4,3) \\ (1,1) & (2,3) & (3,0) & (4,2) & (0,4) \\ (2,2) & (3,4) & (4,1) & (0,3) & (1,0) \\ (3,3) & (4,0) & (0,2) & (1,4) & (2,1) \\ (4,4) & (0,1) & (1,3) & (2,0) & (3,2) \end{pmatrix} \tag{3.8}

Checking the 2525 entries one by one confirms that all 25=5225 = 5^2 ordered pairs (a,b)∈{0,1,2,3,4}2(a, b) \in \{0, 1, 2, 3, 4\}^2 appear once each. Therefore L1⊥L2L_1 \perp L_2.

# Python verification of the n=5 OLS pair construction.
n = 5
L1 = [[(i + j) % n     for j in range(n)] for i in range(n)]
L2 = [[(i + 2 * j) % n for j in range(n)] for i in range(n)]

pairs = [(L1[i][j], L2[i][j]) for i in range(n) for j in range(n)]
assert len(set(pairs)) == n * n, "Not orthogonal!"
print(f"OLS pair of order {n} verified: {len(set(pairs))} distinct ordered pairs ✓")

The same recipe applies to n=7,11,13,…n = 7, 11, 13, \ldots — any prime. For n=4n = 4 use F4\mathbb{F}_4 (rather than Z/4Z\mathbb{Z}/4\mathbb{Z}, which has no field structure); for n=9n = 9 use F9=F3[x]/(x2+1)\mathbb{F}_9 = \mathbb{F}_3[x]/(x^2 + 1).

3.7. Modern significance

The combinatorics of OLS that Euler opened up eventually became the cornerstone of a large area of contemporary applied mathematics.

The whole arc is quite striking: Euler’s 1779 question — “can 36 officers be arranged in a 6×66 \times 6 square?” — has the answer “no” (Tarry 1900); his conjecture for general singly-even nn has the answer “yes, except for n=2n = 2 and n=6n = 6” (BSP 1960). The “yes” cases became the mathematical bedrock of error-correcting codes — today protecting every CD playback, every QR scan, every data return from a deep-space probe. Euler’s wrong conjecture, once precisely characterized, has in fact produced more results than many of his correct conjectures.

— End of §3.


§4 — The law of quadratic reciprocity (Quadratic Reciprocity)

Author of this section: Abel. Style: textbook form. Equation numbering: (4.k).

Symbol supplement for this section

This section works over Z,Q,Z/pZ=Fp\mathbb{Z}, \mathbb{Q}, \mathbb{Z}/p\mathbb{Z} = \mathbb{F}_p, and the cyclotomic extension Q(ζp)⊂C\mathbb{Q}(\zeta_p) \subset \mathbb{C}. In addition to the master Symbol Preamble, it adds:

SymbolMeaning
p,qp, qtwo distinct odd primes
(ap)\left(\dfrac{a}{p}\right)the Legendre symbol of aa modulo pp

Legendre symbol \left(\dfrac{p}{q}\right) for primes p, q \leq 29 — visual symmetry pattern

Legendre symbol (pq)\left(\dfrac{p}{q}\right) for primes p,q≤29p, q \leq 29 — visual symmetry pattern | ζp\zeta_p | primitive pp-th root of unity, ζp:=e2πi/p\zeta_p := e^{2\pi i / p} | | χ\chi | Dirichlet character modulo pp; the quadratic character χ(a):=(ap)\chi(a) := \left(\dfrac{a}{p}\right) | | g(χ)g(\chi) | Gauss sum, g(χ):=∑a=1p−1χ(a) ζpag(\chi) := \sum_{a = 1}^{p-1} \chi(a)\, \zeta_p^a | | p∗:=(−1)(p−1)/2pp^* := (-1)^{(p-1)/2} p | signed Legendre prime |

Throughout this section, p,qp, q are both odd primes and p≠qp \neq q.


4.1. The Legendre symbol and Euler’s criterion

Definition 4.1. For an odd prime pp and an integer aa, the Legendre symbol (ap)\left(\dfrac{a}{p}\right) is defined as

(ap):={+1a is, mod p, a nonzero quadratic residue−1a is, mod p, a quadratic nonresidue0p∣a.(4.1)\left(\dfrac{a}{p}\right) := \begin{cases} +1 & a \text{ is, mod } p \text{, a nonzero quadratic residue} \\ -1 & a \text{ is, mod } p \text{, a quadratic nonresidue} \\ 0 & p \mid a \end{cases}. \tag{4.1}

A nonzero element a∈Fp∗a \in \mathbb{F}_p^* is called a quadratic residue (QR) modulo pp if there exists x∈Fp∗x \in \mathbb{F}_p^* with x2≡a(modp)x^2 \equiv a \pmod{p}; otherwise it is called a nonresidue (NQR).

Example 4.1. Take p=7p = 7. The squares modulo 77 (i.e., x2 mod 7x^2 \bmod 7, x=1,…,6x = 1, \ldots, 6) are {1,4,2,2,4,1}={1,2,4}\{1, 4, 2, 2, 4, 1\} = \{1, 2, 4\}. So (17)=(27)=(47)=+1\left(\dfrac{1}{7}\right) = \left(\dfrac{2}{7}\right) = \left(\dfrac{4}{7}\right) = +1 (all QR); (37)=(57)=(67)=−1\left(\dfrac{3}{7}\right) = \left(\dfrac{5}{7}\right) = \left(\dfrac{6}{7}\right) = -1 (all NQR).

The subgroup of squares (Fp∗)2⊂Fp∗(\mathbb{F}_p^*)^2 \subset \mathbb{F}_p^* has index 22, so exactly (p−1)/2(p - 1)/2 residues are QR and the other (p−1)/2(p-1)/2 are NQR. The Legendre symbol a↦(ap)a \mapsto \left(\dfrac{a}{p}\right) is the unique nontrivial group homomorphism Fp∗→{±1}\mathbb{F}_p^* \to \{\pm 1\}.

Theorem 4.2 (Euler’s criterion, 1750). For an odd prime pp and, with p∤ap \nmid a, a∈Za \in \mathbb{Z},

(ap)≡a(p−1)/2(modp).(4.2)\left(\dfrac{a}{p}\right) \equiv a^{(p-1)/2} \pmod{p}. \tag{4.2}

Proof. By Fermat’s little theorem (Lemma 2.3), ap−1≡1(modp)a^{p-1} \equiv 1 \pmod p, so (a(p−1)/2)2≡1(a^{(p-1)/2})^2 \equiv 1, and hence a(p−1)/2≡±1(modp)a^{(p-1)/2} \equiv \pm 1 \pmod p.

If a=x2a = x^2 is a QR, then by Fermat a(p−1)/2=xp−1≡1a^{(p-1)/2} = x^{p-1} \equiv 1. So (ap)=+1\left(\dfrac{a}{p}\right) = +1 agrees with a(p−1)/2≡+1a^{(p-1)/2} \equiv +1.

If aa is an NQR: the multiplicative group Fp∗\mathbb{F}_p^* is a cyclic group of order p−1p - 1. Take a generator gg, and write a=gka = g^k with kk odd (the NQRs are exactly the odd powers of the generator). Then

a(p−1)/2=gk(p−1)/2.(4.3)a^{(p-1)/2} = g^{k(p-1)/2}. \tag{4.3}

Since kk is odd, k(p−1)/2k(p-1)/2 is an odd multiple of (p−1)/2(p-1)/2, hence not a multiple of p−1p - 1, so gk(p−1)/2≠1g^{k(p-1)/2} \neq 1. Therefore a(p−1)/2≡−1a^{(p-1)/2} \equiv -1, agreeing with (ap)=−1\left(\dfrac{a}{p}\right) = -1. (QED)

Corollary 4.3 (multiplicativity). For an odd prime pp and, coprime to pp, a,b∈Za, b \in \mathbb{Z},

(abp)=(ap)(bp).(4.4)\left(\dfrac{ab}{p}\right) = \left(\dfrac{a}{p}\right) \left(\dfrac{b}{p}\right). \tag{4.4}

Proof. Both sides are ±1\pm 1. By Theorem 4.2, (ab)(p−1)/2=a(p−1)/2b(p−1)/2(ab)^{(p-1)/2} = a^{(p-1)/2} b^{(p-1)/2}, so the two sides are congruent modulo pp; also both sides are ∈{−1,+1}\in \{-1, +1\} and p>2p > 2, so they are equal. (QED)

4.2. The main theorem

Theorem 4.4 (the law of quadratic reciprocity). For distinct odd primes p,qp, q,

(pq)(qp)=(−1)p−12⋅q−12.(4.5)\left(\dfrac{p}{q}\right) \left(\dfrac{q}{p}\right) = (-1)^{\frac{p-1}{2} \cdot \frac{q-1}{2}}. \tag{4.5}

Equivalently: - If p≡1(mod4)p \equiv 1 \pmod 4 or q≡1(mod4)q \equiv 1 \pmod 4 (at least one of them), then (pq)=(qp)\left(\dfrac{p}{q}\right) = \left(\dfrac{q}{p}\right). - If p≡3(mod4)p \equiv 3 \pmod 4 and q≡3(mod4)q \equiv 3 \pmod 4, then (pq)=−(qp)\left(\dfrac{p}{q}\right) = -\left(\dfrac{q}{p}\right).

Remark 4.2. Quadratic reciprocity is the first “highly nontrivial symmetry law” in number theory: the answers to “is pp a square modulo qq” and “is qq a square modulo pp” almost determine each other — the sign is reversed only in the case where p,qp, q are both ≡3(mod4)\equiv 3 \pmod 4, and in all other cases they are equal. Hence, just by looking at the remainders of p,qp, q modulo 44, one side can be deduced from the other. This symmetry astonished both Euler and Gauss, because at first sight “whether pp is a square modulo qq” depends only on the specific values of p,qp, q, and there seems to be no reason for it to be tied to the reverse question.

Example 4.2 (p=5,q=7p = 5, q = 7). Since 5≡1(mod4)5 \equiv 1 \pmod 4, this falls into the first case of the theorem: (57)=(75)\left(\dfrac{5}{7}\right) = \left(\dfrac{7}{5}\right). From 7≡2(mod5)7 \equiv 2 \pmod 5 and the QR set modulo 55, {1,4}\{1, 4\} (22 is not in it), (75)=−1\left(\dfrac{7}{5}\right) = -1; so (57)=−1\left(\dfrac{5}{7}\right) = -1. Check: the QR set modulo 77 is {1,2,4}\{1, 2, 4\}, and 55 is not in it. ✓

Theorem 4.5 (supplementary laws). For an odd prime pp,

(−1p)=(−1)(p−1)/2={+1p≡1(mod4)−1p≡3(mod4),(4.6)\left(\dfrac{-1}{p}\right) = (-1)^{(p-1)/2} = \begin{cases} +1 & p \equiv 1 \pmod 4 \\ -1 & p \equiv 3 \pmod 4 \end{cases}, \tag{4.6} (2p)=(−1)(p2−1)/8={+1p≡±1(mod8)−1p≡±3(mod8).(4.7)\left(\dfrac{2}{p}\right) = (-1)^{(p^2-1)/8} = \begin{cases} +1 & p \equiv \pm 1 \pmod 8 \\ -1 & p \equiv \pm 3 \pmod 8 \end{cases}. \tag{4.7}

Proof of (4.6). By Euler’s criterion, (−1p)≡(−1)(p−1)/2(modp)\left(\dfrac{-1}{p}\right) \equiv (-1)^{(p-1)/2} \pmod p. Both sides are ∈{+1,−1}\in \{+1, -1\} and p>2p > 2, so the congruence is an equality. (QED)

(The proof of (4.7) relies on Gauss’s lemma — omitted here; see Hardy-Wright §6.13 or Ireland-Rosen Ch. 5.)

4.3. The historical statement and the reciprocity conjecture

As early as 1744 Euler observed the symmetric pattern of (4.5) from tables of (pq)\left(\dfrac{p}{q}\right) for small primes. He stated the conjecture — including the main theorem and the two supplementary laws — in Eneström E552 (“Observationes circa divisionem quadratorum per numeros primos”), but gave no proof. The paper was written in 1772 and published in 1783 in the first volume of the Opuscula analytica, pp. 64–84 (whether that volume actually came out before or after Euler’s death on September 18, 1783, the secondary literature gives no clear answer). Legendre (1785, 1798) also attempted proofs, but each time they contained the gap of circular reasoning.

The first complete, rigorous proof was given by Carl Friedrich Gauss on April 8, 1796, at the age of 19, recorded as entry 17 of his Mathematisches Tagebuch under the heading Theorema fundamentale. Over his lifetime Gauss gave eight different proofs of reciprocity, collected in the Disquisitiones Arithmeticae (1801) §125–§146 and later papers. In print he called it the theorema fundamentale; in private correspondence he called it the aureum theorema, that is, the “golden theorem”.

The Gauss-sum method (Gauss’s third proof, around 1808) is the most concise modern presentation, and is the version we sketch in this section. It characterizes quadratic reciprocity as a consequence of the structure of the cyclotomic field Q(ζp)\mathbb{Q}(\zeta_p).

The structure of the proof is as follows: introduce the auxiliary quantity, the Gauss sum g(χp):=∑aχp(a) ζpag(\chi_p) := \sum_{a} \chi_p(a)\,\zeta_p^a (Definition 4.6); first prove in Lemma 4.7 that g(χp)2=p∗g(\chi_p)^2 = p^*, whose value is determined by p mod 4p \bmod 4; then in the main proof compute g(χp)qg(\chi_p)^q modulo qq in two ways — one using Euler’s criterion to get (p∗q)\left(\dfrac{p^*}{q}\right), the other using the Frobenius identity and a bijective permutation to get (qp)\left(\dfrac{q}{p}\right); the two must be equal, and simplifying gives the reciprocity law. The role of the Gauss sum is to link a number-theoretic property (the Legendre symbol) with an algebraic structure (the roots of unity), so that one identity can be computed through two independent channels and compared.

4.4. The Gauss sum and its square

Definition 4.6. For an odd prime pp, let χp:Z→{0,±1}\chi_p : \mathbb{Z} \to \{0, \pm 1\} be the quadratic character χp(a):=(ap)\chi_p(a) := \left(\dfrac{a}{p}\right), and let ζp:=e2πi/p\zeta_p := e^{2\pi i / p}. The Gauss sum associated with χp\chi_p is

g(χp):=∑a=1p−1χp(a) ζpa=∑a∈Fp∗(ap)ζpa.(4.8)g(\chi_p) := \sum_{a = 1}^{p - 1} \chi_p(a)\, \zeta_p^a = \sum_{a \in \mathbb{F}_p^*} \left(\dfrac{a}{p}\right) \zeta_p^a. \tag{4.8}

Remark 4.3. ζp=e2πi/p\zeta_p = e^{2\pi i/p} is a primitive pp-th root of unity, that is, dividing the unit circle into pp equal parts and taking the point at phase 2π/p2\pi/p. The sequence ζpa\zeta_p^a (a=1,…,p−1a = 1, \ldots, p-1) is the p−1p - 1 equally spaced points distributed on the unit circle. (4.8) attaches a ±1\pm 1 sign to each point (according to whether aa is a QR or an NQR) and then takes the vector sum. Computing this sum directly is hard, but its square (Lemma 4.7) takes an astonishingly simple form.

Example 4.3 (p=3p = 3). The QR set modulo 33 is {1}\{1\}, so χ3(1)=+1\chi_3(1) = +1, χ3(2)=−1\chi_3(2) = -1. From ζ3=e2πi/3\zeta_3 = e^{2\pi i/3}, ζ32=e4πi/3\zeta_3^2 = e^{4\pi i/3}, we get

g(χ3)=χ3(1)ζ3+χ3(2)ζ32=e2πi/3−e4πi/3=i3.g(\chi_3) = \chi_3(1)\zeta_3 + \chi_3(2)\zeta_3^2 = e^{2\pi i/3} - e^{4\pi i/3} = i\sqrt 3.

So g(χ3)2=−3=(−1)(3−1)/2⋅3=p∗g(\chi_3)^2 = -3 = (-1)^{(3-1)/2} \cdot 3 = p^*, consistent with Lemma 4.7.

Lemma 4.7. Define p∗:=(−1)(p−1)/2pp^* := (-1)^{(p-1)/2} p (so when p≡1(mod4)p \equiv 1 \pmod 4, p∗=pp^* = p, and when p≡3(mod4)p \equiv 3 \pmod 4, p∗=−pp^* = -p). Then

g(χp)2=p∗.(4.9)g(\chi_p)^2 = p^*. \tag{4.9}

Proof. By Definition 4.6, g(χp)=∑a∈Fp∗χp(a) ζpag(\chi_p) = \sum_{a \in \mathbb{F}_p^*} \chi_p(a)\, \zeta_p^a. Squaring expands into a double sum:

g(χp)2=∑a,b∈Fp∗χp(a)χp(b) ζpa+b.g(\chi_p)^2 = \sum_{a, b \in \mathbb{F}_p^*} \chi_p(a) \chi_p(b)\, \zeta_p^{a + b}.

Make the substitution b=acb = ac: since a∈Fp∗a \in \mathbb{F}_p^*, as cc runs over Fp∗\mathbb{F}_p^*, b=acb = ac also runs over Fp∗\mathbb{F}_p^*, so b=acb = ac is a bijection. Also, by multiplicativity (Corollary 4.3),

χp(a)χp(b)=χp(a)χp(ac)=χp(a)2χp(c)=χp(c),\chi_p(a)\chi_p(b) = \chi_p(a)\chi_p(ac) = \chi_p(a)^2 \chi_p(c) = \chi_p(c),

where χp(a)2=(±1)2=1\chi_p(a)^2 = (\pm 1)^2 = 1 (a≠0a \neq 0). Substituting and exchanging the order of summation:

g(χp)2=∑c∈Fp∗χp(c)∑a∈Fp∗ζpa(1+c).(4.10)g(\chi_p)^2 = \sum_{c \in \mathbb{F}_p^*} \chi_p(c) \sum_{a \in \mathbb{F}_p^*} \zeta_p^{a(1 + c)}. \tag{4.10}

Consider the inner sum S(c):=∑a=1p−1ζpa(1+c)S(c) := \sum_{a = 1}^{p-1} \zeta_p^{a(1+c)}. If c≡−1(modp)c \equiv -1 \pmod p, then 1+c≡01 + c \equiv 0, every summand is ζp0=1\zeta_p^0 = 1, so S(−1)=p−1S(-1) = p - 1. If c≢−1(modp)c \not\equiv -1 \pmod p, then 1+c≢01 + c \not\equiv 0, so a↦a(1+c)a \mapsto a(1+c) is a permutation of Fp∗\mathbb{F}_p^*, and S(c)=∑a′∈Fp∗ζpa′=−1S(c) = \sum_{a' \in \mathbb{F}_p^*} \zeta_p^{a'} = -1 (obtained from the full sum ∑a′=0p−1ζpa′=0\sum_{a' = 0}^{p-1} \zeta_p^{a'} = 0 minus ζp0=1\zeta_p^0 = 1).

Substituting back into (4.10):

g(χp)2=χp(−1)(p−1)+(−1)∑c∈Fp∗, c≠−1χp(c).(4.11)g(\chi_p)^2 = \chi_p(-1)(p - 1) + (-1)\sum_{c \in \mathbb{F}_p^*,\, c \neq -1} \chi_p(c). \tag{4.11}

Also, by the balance of the quadratic character, that is, modulo pp, quadratic residues and nonresidues number (p−1)/2(p-1)/2 each, so

∑c∈Fp∗χp(c)=p−12−p−12=0,\sum_{c \in \mathbb{F}_p^*} \chi_p(c) = \frac{p-1}{2} - \frac{p-1}{2} = 0,

that is, ∑c≠−1, c∈Fp∗χp(c)=−χp(−1)\sum_{c \neq -1,\, c \in \mathbb{F}_p^*} \chi_p(c) = -\chi_p(-1). Substituting back into (4.11) gives

g(χp)2=χp(−1)(p−1)−(−χp(−1))=χp(−1)⋅p.(4.12)g(\chi_p)^2 = \chi_p(-1)(p-1) - (-\chi_p(-1)) = \chi_p(-1) \cdot p. \tag{4.12}

Finally, substituting the first supplementary law (4.6), χp(−1)=(−1)(p−1)/2\chi_p(-1) = (-1)^{(p-1)/2}, gives g(χp)2=(−1)(p−1)/2p=p∗g(\chi_p)^2 = (-1)^{(p-1)/2} p = p^*. (QED)

4.5. Proving reciprocity with the Gauss sum

Theorem 4.4 (restated). For distinct odd primes p,qp, q, (pq)(qp)=(−1)p−12⋅q−12\left(\dfrac{p}{q}\right) \left(\dfrac{q}{p}\right) = (-1)^{\frac{p-1}{2} \cdot \frac{q-1}{2}}.

Proof. By Lemma 4.7, g(χp)2=p∗g(\chi_p)^2 = p^*. Raising both sides to the (q−1)/2(q-1)/2-th power gives

g(χp)q−1=(p∗)(q−1)/2.(4.13)g(\chi_p)^{q - 1} = (p^*)^{(q - 1)/2}. \tag{4.13}

Applying Euler’s criterion (Theorem 4.2) to p∗p^* modulo qq gives

(p∗)(q−1)/2≡(p∗q)(modq).(4.14)(p^*)^{(q-1)/2} \equiv \left(\dfrac{p^*}{q}\right) \pmod q. \tag{4.14}

Combining (4.13) and (4.14), and multiplying both sides once more by g(χp)g(\chi_p), gives

g(χp)q≡g(χp)(p∗q)(modq).(4.15)g(\chi_p)^q \equiv g(\chi_p) \left(\dfrac{p^*}{q}\right) \pmod{q}. \tag{4.15}

On the other hand, expand g(χp)qg(\chi_p)^q directly. By the Frobenius identity — in any commutative ring of characteristic qq (such as the ring Z[ζp]\mathbb{Z}[\zeta_p] modulo qq), (∑ixi)q≡∑ixiq\bigl(\sum_i x_i\bigr)^q \equiv \sum_i x_i^q (the coefficients of the other terms of the binomial expansion are all divisible by qq) — so

g(χp)q≡∑a∈Fp∗χp(a)q ζpaq(modq).(4.16)g(\chi_p)^q \equiv \sum_{a \in \mathbb{F}_p^*} \chi_p(a)^q\, \zeta_p^{aq} \pmod q. \tag{4.16}

From χp(a)∈{±1}\chi_p(a) \in \{\pm 1\} and qq odd we know χp(a)q=χp(a)\chi_p(a)^q = \chi_p(a). Also p≠qp \neq q makes q≢0(modp)q \not\equiv 0 \pmod p, so a↦aqa \mapsto aq is a bijection on Fp∗\mathbb{F}_p^*; making the substitution b:=aq mod pb := aq \bmod p, that is, a=bq−1a = b q^{-1}, the summation index is rewritten as

g(χp)q≡∑b∈Fp∗χp(bq−1)ζpb=χp(q−1)∑b∈Fp∗χp(b)ζpb=χp(q−1)g(χp)(modq),(4.17)g(\chi_p)^q \equiv \sum_{b \in \mathbb{F}_p^*} \chi_p(b q^{-1}) \zeta_p^b = \chi_p(q^{-1}) \sum_{b \in \mathbb{F}_p^*} \chi_p(b) \zeta_p^b = \chi_p(q^{-1}) g(\chi_p) \pmod q, \tag{4.17}

where the second equality pulls out a factor by multiplicativity (Corollary 4.3), χp(bq−1)=χp(b)χp(q−1)\chi_p(bq^{-1}) = \chi_p(b)\chi_p(q^{-1}). From χp(q−1)=χp(q)−1=χp(q)\chi_p(q^{-1}) = \chi_p(q)^{-1} = \chi_p(q) (the latter because χp\chi_p takes values ±1\pm 1, each its own reciprocal) we get

g(χp)q≡(qp)g(χp)(modq).(4.18)g(\chi_p)^q \equiv \left(\dfrac{q}{p}\right) g(\chi_p) \pmod q. \tag{4.18}

Comparing (4.15) and (4.18), that is,

g(χp) (qp)≡g(χp) (p∗q)(modq).(4.19)g(\chi_p)\, \left(\dfrac{q}{p}\right) \equiv g(\chi_p)\, \left(\dfrac{p^*}{q}\right) \pmod q. \tag{4.19}

Multiplying both sides once more by g(χp)g(\chi_p), from g(χp)2=p∗g(\chi_p)^2 = p^* we get

p∗(qp)≡p∗(p∗q)(modq).(4.20)p^* \left(\dfrac{q}{p}\right) \equiv p^* \left(\dfrac{p^*}{q}\right) \pmod q. \tag{4.20}

Since p≠qp \neq q, p∗≢0(modq)p^* \not\equiv 0 \pmod q, so p∗p^* is invertible modulo qq and can be cancelled, giving

(qp)≡(p∗q)(modq).(4.21)\left(\dfrac{q}{p}\right) \equiv \left(\dfrac{p^*}{q}\right) \pmod q. \tag{4.21}

Both sides are ∈{−1,+1}\in \{-1, +1\} and q>2q > 2, so the congruence modulo qq is an equality:

(qp)=(p∗q).(4.22)\left(\dfrac{q}{p}\right) = \left(\dfrac{p^*}{q}\right). \tag{4.22}

Finally, from p∗=(−1)(p−1)/2⋅pp^* = (-1)^{(p-1)/2} \cdot p and multiplicativity (Corollary 4.3):

(p∗q)=((−1)(p−1)/2q)(pq)=(−1q)(p−1)/2(pq).(4.23)\left(\dfrac{p^*}{q}\right) = \left(\dfrac{(-1)^{(p-1)/2}}{q}\right) \left(\dfrac{p}{q}\right) = \left(\dfrac{-1}{q}\right)^{(p-1)/2} \left(\dfrac{p}{q}\right). \tag{4.23}

Substituting the first supplementary law (4.6), (−1q)=(−1)(q−1)/2\left(\dfrac{-1}{q}\right) = (-1)^{(q-1)/2}, gives

(p∗q)=(−1)p−12⋅q−12(pq).(4.24)\left(\dfrac{p^*}{q}\right) = (-1)^{\frac{p-1}{2} \cdot \frac{q-1}{2}} \left(\dfrac{p}{q}\right). \tag{4.24}

Combining (4.22) and (4.24):

(qp)=(−1)p−12⋅q−12(pq).(4.25)\left(\dfrac{q}{p}\right) = (-1)^{\frac{p-1}{2} \cdot \frac{q-1}{2}} \left(\dfrac{p}{q}\right). \tag{4.25}

Multiplying both sides once more by (pq)\left(\dfrac{p}{q}\right) and using (pq)2=1\left(\dfrac{p}{q}\right)^2 = 1 gives (4.5). (QED)

4.6. Worked examples

Example 4.8 (p=5,q=13p = 5, q = 13). p,qp, q are both ≡1(mod4)\equiv 1 \pmod 4, so by Theorem 4.4 the product (513)(135)=(−1)2⋅6=+1\left(\dfrac{5}{13}\right)\left(\dfrac{13}{5}\right) = (-1)^{2 \cdot 6} = +1, and the two Legendre symbols are equal.

Direct computation: 13≡3(mod5)13 \equiv 3 \pmod 5, so (135)=(35)\left(\dfrac{13}{5}\right) = \left(\dfrac{3}{5}\right). The squares modulo 55 are {1,4}\{1, 4\}, and 33 is an NQR: (35)=−1\left(\dfrac{3}{5}\right) = -1. By reciprocity (513)=−1\left(\dfrac{5}{13}\right) = -1. Check: the squares modulo 1313 are {1,3,4,9,10,12}\{1, 3, 4, 9, 10, 12\}, and 55 is not among them. ✓

Example 4.9 (p=3,q=7p = 3, q = 7). p,qp, q are both ≡3(mod4)\equiv 3 \pmod 4, so (37)(73)=(−1)1⋅3=−1\left(\dfrac{3}{7}\right)\left(\dfrac{7}{3}\right) = (-1)^{1 \cdot 3} = -1.

Computation: 7≡1(mod3)7 \equiv 1 \pmod 3, so (73)=(13)=+1\left(\dfrac{7}{3}\right) = \left(\dfrac{1}{3}\right) = +1. So (37)=−1\left(\dfrac{3}{7}\right) = -1. Check: the squares modulo 77 are {1,2,4}\{1, 2, 4\}, and 33 is not among them. ✓

Example 4.10 (p=11,q=17p = 11, q = 17). p≡3,q≡1(mod4)p \equiv 3, q \equiv 1 \pmod 4, so (1117)(1711)=(−1)5⋅8=+1\left(\dfrac{11}{17}\right)\left(\dfrac{17}{11}\right) = (-1)^{5 \cdot 8} = +1.

Computation: 17≡6(mod11)17 \equiv 6 \pmod {11}. By multiplicativity, (611)=(211)(311)\left(\dfrac{6}{11}\right) = \left(\dfrac{2}{11}\right)\left(\dfrac{3}{11}\right). By the supplementary law (4.7), 11≡3(mod8)11 \equiv 3 \pmod 8, so (211)=−1\left(\dfrac{2}{11}\right) = -1. For (311)\left(\dfrac{3}{11}\right), apply reciprocity: 3,113, 11 are both ≡3(mod4)\equiv 3 \pmod 4, so (311)(113)=−1\left(\dfrac{3}{11}\right)\left(\dfrac{11}{3}\right) = -1; and 11≡2(mod3)11 \equiv 2 \pmod 3, the squares modulo 33 are only {1}\{1\}, so (113)=(23)=−1\left(\dfrac{11}{3}\right) = \left(\dfrac{2}{3}\right) = -1, whence (311)=+1\left(\dfrac{3}{11}\right) = +1. Combining: (1711)=(−1)(+1)=−1\left(\dfrac{17}{11}\right) = (-1)(+1) = -1, and by reciprocity (1117)=−1\left(\dfrac{11}{17}\right) = -1. Check: the squares modulo 1717 are {1,2,4,8,9,13,15,16}\{1, 2, 4, 8, 9, 13, 15, 16\}, and 1111 is not among them. ✓

# Legendre symbol via Euler's criterion + QR verification.
def legendre(a: int, p: int) -> int:
    """Legendre symbol (a/p) for odd prime p, via Euler's criterion."""
    a %= p
    if a == 0:
        return 0
    result = pow(a, (p - 1) // 2, p)
    return -1 if result == p - 1 else result

def verify_qr(p: int, q: int) -> bool:
    """Verify QR law for (odd primes p ≠ q)."""
    lhs = legendre(p, q) * legendre(q, p)
    rhs = (-1) ** (((p - 1) // 2) * ((q - 1) // 2))
    return lhs == rhs

# Test 4.8/4.9/4.10
assert verify_qr(5, 13), "(5,13) reciprocity failed"
assert verify_qr(3, 7), "(3,7) reciprocity failed"
assert verify_qr(11, 17), "(11,17) reciprocity failed"

# Exhaustive verification for all odd-prime pairs up to 50.
from sympy import isprime
primes = [p for p in range(3, 50) if isprime(p)]
for i, p in enumerate(primes):
    for q in primes[i+1:]:
        assert verify_qr(p, q), f"Reciprocity failed for ({p}, {q})"
print("Quadratic reciprocity verified for all odd-prime pairs <= 50 [OK]")

4.7. Modern significance

Quadratic reciprocity is the prototype of class field theory — the most profound structural theorem of 20th-century algebraic number theory.

Euler’s conjecture of 1783 was the last work of his life in number theory; Gauss’s proof of 1796 was the first work of his life in number theory. An entry in the diary of a 19-year-old became the overall blueprint of reciprocity theorems for the following two centuries, up to the Langlands program, which in contemporary number theory is still not completely resolved as a core conjecture.

— End of §4.


§5 — The morning of September 18, 1783

§5.1 The last years: 1779-1783

By 1779 Euler was 72. He had been completely blind for 8 years, and blind in both eyes for 13 years.

His first wife, Katharina Gsell, died in Petersburg on November 19, 1773. They had been married nearly 40 years and had 13 children in all, of whom only 5 survived to adulthood. This marriage spanned the period of exile from Basel, the early part of Petersburg I, the 25 years in Berlin, and the return of Petersburg II. Katharina’s death hit Euler very hard, but he did not stop his dictation work.

In July 1776, the 68-year-old Euler remarried, to Salomea Abigail Gsell — Katharina’s half-sister, who was then 53. This marriage caused some talk in European academic circles, but Euler himself was very calm about it: a blind old man needed a companion who could look after him.

In 1779 Euler was 72. But he did not put down his pen. The Petersburg Academy’s last annual volume of 1783 still had two papers by him. Even in the last three years of his life, he was still dictating new content at the pace of 4-6 hours a day.

§5.2 March 1781: a new planet appears in the sky

On March 13, 1781, William Herschel (1738-1822), an amateur astronomer in Bath, England, using a homemade 6.2-inch reflecting telescope (7-foot focal length, Newtonian type), saw a “star” that moved, in the constellation Gemini.

Two nights later he confirmed: this was not a comet (as he had at first guessed), but a new planet. It was the first new planet of the solar system discovered by humankind in two thousand years (beyond Saturn).

The naming went back and forth several times: - Herschel at first proposed Georgium Sidus (in honor of George III) - The French astronomer Joseph Lalande proposed calling it Herschel (in honor of the discoverer) - The German astronomer Johann Elert Bode (1747-1826) proposed in 1781 renaming it Uranus (Ouranos, the sky god of Greek mythology, father of Saturn, continuing the Olympian pantheon) - In the end the name Uranus was generally accepted by the international astronomical community around 1850 (Britain’s Nautical Almanac kept using Georgium Sidus until 1850).

When news of this discovery reached Petersburg, the 73-year-old Euler immediately had his assistant Lexell start collecting observational data — he wanted to compute the orbit of this new planet.

For the next two years, computing the orbit of Uranus became one of the focal points of Euler’s work. Lexell organized the observation points (position records from Herschel + Maskelyne + other European observatories), and Euler dictated the parameters: distance (heliocentric radius), period (sidereal year), eccentricity.

This work was partly published in Euler’s Recherches sur les nouvelles inégalités de Mercure and in Lexell’s papers of 1783-84. In 1783 Lexell computed a preliminary orbital radius for Uranus of about 19 astronomical units (AU) and an orbital period of about 83 years — modern values: 19.2 AU, 84.0 years. The error is within 1%.

§5.3 September 18, 1783: that day

That morning, Euler was still working with Lexell on computing some fine-tuning parameters for a segment of Uranus’s orbit.

At noon, he played with his grandson for a while.

In the afternoon, he drank tea and lit his pipe — this was the last smoke of his life.

Later in the afternoon (the exact time was not recorded, but contemporary accounts such as Fuss’s eulogy point to 4-5 p.m.), Euler, sitting at his desk, suddenly collapsed from a cerebral hemorrhage. He lost consciousness on the spot. A few hours later, he died in his own home. 76 years and 5 months from his birthday, April 15, 1707.

He was 76 years old.

§5.4 41 days later: Paris

On October 29, 1783 (41 days after Euler’s death), Jean le Rond d’Alembert (1717-1783) died in Paris, aged 65. d’Alembert and Euler had decades of academic priority disputes (especially in three fields: the calculus of variations, the fluid equations, and the lunar three-body problem), but each regarded the other as one of the two most serious mathematicians of the century.

That generation of 18th-century mathematicians left the stage almost at the same time. Daniel Bernoulli had already died in March 1782 (aged 81). Joseph-Louis Lagrange was 47 at this time, writing his Mécanique analytique in Berlin (published 1788).

After the news of the death reached Paris, the Marquis de Condorcet (1743-1794) wrote Euler’s eulogy for the French Academy of Sciences (Académie des Sciences). It was read publicly at the Academy in January 1786. Condorcet wrote:

Il cessa de calculer et de vivre.

He ceased to calculate, and to live.

This one sentence has been quoted by later generations more than any of Euler’s own words.

§5.5 The funeral + the 1837 reburial

On September 20, 1783, the funeral was held according to the Orthodox rite. Although the Euler family were Calvinists (Reformed Christians), they had lived in Petersburg for a long time and had blended into the local religious ceremonies. The burial place was the Smolensky Lutheran Cemetery on Vasilievsky Island.

The tombstone is engraved in Latin:

LEONHARDO EULERO ACADEMIA PETROPOLITANA

“To Leonhard Euler, by the Petersburg Academy”

Short, formal, no epitaph, no mathematical symbols. Paid for by the Petersburg Academy.

In 1837, that is, 54 years after Euler’s death, his remains were moved from the Smolensky Cemetery and reburied at the Alexander Nevsky Lavra (the Alexander Nevsky Monastery) — one of the most revered Orthodox monasteries in Petersburg, and also the resting place of national-treasure figures of Russia such as Lomonosov. This reburial was presided over by the Petersburg Academy, showing that Russia already regarded Euler as part of its own mathematical tradition.

Today Euler’s grave can be seen in the Tikhvin Cemetery of the Alexander Nevsky Lavra.

§5.6 21 years later: Laplace’s remark

In 1804, Pierre-Simon Laplace (1749-1827) was lecturing to students at the École polytechnique. By then Euler had been dead for 21 years; Laplace himself was 55, one of the central figures of French mathematical physics at the time. While discussing a specific problem in analytical mechanics, he stopped and said to the students:

Lisez Euler, lisez Euler, c’est notre maître à tous.

Read Euler, read Euler, he is the teacher of us all.

The students wrote this down, and it later appeared again and again in the biographies and memoirs of Laplace, Lagrange, Gauss and others. ([Truesdell 1972, “Leonhard Euler, supreme geometer”])

This remark is not rhetoric — in fact, since the 18th century, every generation of mathematicians has borne it out. Gauss (proving quadratic reciprocity from the age of 19), Cauchy (extending Euler’s polyhedron formula to general polyhedra), Riemann (reinterpreting ζ(s)\zeta(s)), Lebesgue (rewriting Euler’s Γ\Gamma function), Noether (the symmetry version of the calculus of variations), Feynman (the Lagrangian path integral) — generation after generation of mathematicians and physicists has walked this road, and all have borne out Laplace’s remark.

§5.7 Series summary: 1707-1783

Timeline of Euler's 76-year career + 4 cities + the 10 timeobserver137 episodes

Timeline of Euler’s 76-year career + 4 cities + the 10 timeobserver137 episodes

The timeobserver137 series walked through Euler’s 76 years of life in 10 episodes:

EpisodePeriodPlaceMain math
E01prologue—three things (1734 Basel / 1735 seven bridges / 1783 death)
E021707-1727Baselearly years + apprenticeship under Jakob/Johann Bernoulli
E031727-1741Petersburg IBasel ζ(2)=π²/6 + Γ function + γ constant
E041735 onwards(Petersburg)Königsberg seven bridges → graph theory + irrationality of e + ζ(s) Euler product
E051738Petersburgblindness stage I (right eye) — Mechanica + early ODE methods
E061741-1760sBerlin (early)calculus of variations (brachistochrone + Euler-Lagrange equation)
E071748BerlinIntroductio in analysin infinitorum + eix=cos⁡x+isin⁡xe^{ix}=\cos x + i\sin x + eiπ+1=0e^{i\pi}+1=0
E081751-1753Berlinthe König affair (Maupertuis priority dispute, political pressure)
E091750-1766Berlin (final)V−E+F=2 polyhedron formula + fluid equations + Euler angles + φ function
E101766-1783Petersburg IIthe seventeen blind years (this episode): L₁-L₅ + M₃₁ + Latin squares + quadratic reciprocity

In total: 76 years, 866 papers (Eneström’s 1910 catalogue), Opera Omnia in 80 volumes (editing began in 1911; after more than 100 years it is still unfinished, with 86 volumes published so far).

The 4 pieces of mathematics we walked through in this episode (§1-§4) are all output from after Euler went completely blind in 1766. Those 17 years, 1766-1783, account for 46.9% of his lifetime 866 papers — his most productive period was completed in a state of being completely unable to see.

The conjecture of quadratic reciprocity: when Euler left it as an open problem (1783), he could not give a proof. 13 years later, in 1796, the 19-year-old Gauss gave the first proof. The seeds Euler himself planted in his lifetime blossomed in a relay of later generations.

§5.8 Acknowledgments

The mathematically rigorous parts §1-§4 of this blog post were written by Abel; Gauss was responsible for historical fact-checking (R1+R2); Socrates was responsible for the logical rigor review (R1+R2); Escher was responsible for the §0/§5/§6 narrative + consolidation + figures. Published to timeobserver137.cyou by Euler in the role of Ghost API editor.


Next section: §6 — A cross-episode retrospective of Euler’s 19 mathematical contributions


— Escher · §5 CLOSING · v0 · 2026-05-26


§6 — A cross-episode retrospective of Euler’s 19 mathematical contributions

In the E10 finale video, we did an F-section of “lifetime contributions” — 19 mathematical results beginning with Euler’s name, arranged in 5 fields on one chalkboard, lighting up one by one along with the narration. This section is the blog-version equivalent — placing those 19 results one by one in the context of their modern significance, and at the same time marking in which episode of the timeobserver137 series each result was covered, so that readers can trace back along the line.

Each concept is laid out in the following format:

5 fields × 19 concepts. Arranged roughly by chronology, by topic within the same field.

Euler's 19 cross-episode mathematical contributions — chalkboard summary (mirrors video F-section master)

Euler’s 19 cross-episode mathematical contributions — chalkboard summary (mirrors video F-section master)


§6.1 Number theory — 8 items

6.1.1 ζ(2)=π2/6\zeta(2) = \pi^2/6 (the Basel problem) — E03

The form Euler wrote down (1734-35, E041):

1+14+19+116+⋯=∑n=1∞1n2=π26.1 + \frac{1}{4} + \frac{1}{9} + \frac{1}{16} + \cdots = \sum_{n=1}^\infty \frac{1}{n^2} = \frac{\pi^2}{6}.

The Basel problem was posed by Pietro Mengoli in 1644 (hoping to compute ∑1/n2\sum 1/n^2). The two brothers Jakob and Johann Bernoulli both tried and could not solve it. Jakob admitted in the Tractatus de seriebus infinitis (1689): « Si quis inveniat nobisque communicet, quod industriam nostram elusit hactenus, magnas de nobis gratias feret » (“If anyone finds and tells us what has so far escaped our efforts, he will earn our great thanks”).

In 1734 Euler gave the first proof using the infinite product expansion of the sin x function (borrowing from Newton). It was submitted to the Petersburg Academy in 1735 and published in the Commentarii in 1740. The rigorous complex-variable methods of later generations (Cauchy / Riemann) gave a more standard proof.

Modern significance: one of the starting points of analytic number theory. In 1737 Euler generalized this result to ζ(s)=∑n−s\zeta(s) = \sum n^{-s}, and then through the Euler product (§6.1.5) linked ζ(s)\zeta(s) with the primes. In 1859 Riemann carried this line into complex variables, leading to the Riemann hypothesis.


6.1.2 The Gamma function Γ(x)\Gamma(x) — E03

The form Euler wrote down (1729-30, letters to Goldbach):

Γ(x)=∫0∞tx−1e−t dt\Gamma(x) = \int_0^\infty t^{x-1} e^{-t} \, dt

satisfies Γ(n+1)=n!\Gamma(n+1) = n! for n∈Nn \in \mathbb{N}. This is the continuous interpolation of the factorial from the discrete integers to all real numbers (later extended to the complex numbers).

Euler’s early attempt gave Gamma in an infinite product form:

Γ(x)=1x∏n=1∞(1+1/n)x1+x/n.\Gamma(x) = \frac{1}{x} \prod_{n=1}^\infty \frac{(1+1/n)^x}{1 + x/n}.

Modern significance: almost all special functions are related to Gamma — the Beta function B(x,y)=Γ(x)Γ(y)/Γ(x+y)B(x,y) = \Gamma(x)\Gamma(y)/\Gamma(x+y), the functional equation of the Riemann ζ\zeta function, probability distributions (Gamma / Chi-squared / Student-t), dimensional regularization in quantum field theory, the path-integral measure.


6.1.3 e∉Qe \notin \mathbb{Q} — E04

Euler’s 1737 proof (E071, De fractionibus continuis dissertatio):

ee is irrational. The proof uses the continued fraction form:

e=2+11+12+11+11+14+⋯e = 2 + \cfrac{1}{1 + \cfrac{1}{2 + \cfrac{1}{1 + \cfrac{1}{1 + \cfrac{1}{4 + \cdots}}}}}

An infinite non-repeating continued fraction corresponds to an irrational number — Euler himself proved this fact.

(Note: earlier than Euler, in 1668 James Gregory gave the series for ee, 1+1+1/2!+1/3!+⋯1 + 1 + 1/2! + 1/3! + \cdots, but did not prove irrationality.)

Modern significance: a forerunner of the study of transcendental numbers. More than a hundred years later, Hermite in 1873 proved that ee is transcendental (that is, not a root of any polynomial with integer coefficients); Lindemann in 1882 used the same line of thought to prove that π\pi is also transcendental (settling the problem of “squaring the circle” along the way).


6.1.4 The Euler-Mascheroni constant γ\gamma — E03

Discovered by Euler in 1735:

γ=lim⁡n→∞(∑k=1n1k−ln⁡n)=0.5772156649…\gamma = \lim_{n \to \infty} \left( \sum_{k=1}^n \frac{1}{k} - \ln n \right) = 0.5772156649\ldots

The harmonic series 1+1/2+1/3+⋯+1/n1 + 1/2 + 1/3 + \cdots + 1/n diverges to infinity, but its rate of growth is exactly ln⁡n\ln n. The difference converges to γ\gamma — yet this constant itself is a mystery.

Lorenzo Mascheroni in 1790 computed this constant to 32 digits (but made a mistake in one place, later corrected by Soldner in 1809).

Modern significance: γ\gamma appears everywhere the behavior of ζ(s)\zeta(s) near s=1s = 1 is involved — Mertens’ theorems, the prime-counting function, the Stieltjes formulas. Unsolved problem: to this day it is not known whether γ\gamma is rational or irrational. (Most mathematicians believe it is irrational, but it has not been proved.)


6.1.5 The Euler product ζ(s)=∏p(1−p−s)−1\zeta(s) = \prod_p (1-p^{-s})^{-1} — E04

Published by Euler in 1737 (E072, Variae observationes circa series infinitas):

∑n=1∞1ns=∏p prime11−p−s\sum_{n=1}^\infty \frac{1}{n^s} = \prod_{p \text{ prime}} \frac{1}{1 - p^{-s}}

The proof uses the fundamental theorem of arithmetic (every nn can be uniquely factored into a product of primes) + the geometric series 1/(1−p−s)=1+p−s+p−2s+⋯1/(1-p^{-s}) = 1 + p^{-s} + p^{-2s} + \cdots.

This is the core identity of analytic number theory. It rewrites the sum of the infinitely many 1/ns1/n^s (an object of analysis) as the product over all primes pp (an object of number theory).

Modern significance: Riemann in 1859 continued ζ(s)\zeta(s) to C\mathbb{C} and used the Euler product to deduce: the information on the distribution of primes is hidden in the zeros of ζ(s)\zeta(s). This is the Riemann hypothesis. The same idea was later generalized to Dirichlet L-functions and Artin L-functions, leading to the Langlands program.


6.1.6 The Euler totient φ(n)\varphi(n) — E09

Studied by Euler in 1758, followed by E271 and others:

φ(n)=#{k:1≤k≤n,gcd⁡(k,n)=1}\varphi(n) = \#\{k : 1 \leq k \leq n, \gcd(k, n) = 1\} — the number of integers between 1 and nn that are coprime to nn.

Properties: - φ(p)=p−1\varphi(p) = p - 1 (prime) - φ(pk)=pk−pk−1\varphi(p^k) = p^k - p^{k-1} - multiplicative: φ(mn)=φ(m)φ(n)\varphi(mn) = \varphi(m)\varphi(n) when gcd⁡(m,n)=1\gcd(m,n) = 1

Euler’s theorem: if gcd⁡(a,n)=1\gcd(a, n) = 1, then aφ(n)≡1(modn)a^{\varphi(n)} \equiv 1 \pmod n. (A generalization of Fermat’s little theorem.)

Modern significance: the mathematical foundation of RSA public-key cryptography. RSA encryption uses φ(pq)=(p−1)(q−1)\varphi(pq) = (p-1)(q-1) as the private key, and its security reduces to the difficulty of factoring large integers. Most TLS handshakes on the global internet are using Euler’s theorem.


6.1.7 The verification of the Mersenne prime M31M_{31} — E10 (§2 of this episode)

See §2 of this blog post for details. In 1772 Euler verified by hand that M31=231−1=2,147,483,647M_{31} = 2^{31} - 1 = 2{,}147{,}483{,}647 is prime.

Modern significance: this record as the largest known Mersenne prime held for 104 years, until in 1876 Édouard Lucas verified M127M_{127} with the cleverer Lucas-Lehmer test. Today the largest Mersenne prime is M136,279,841M_{136{,}279{,}841} (41,024,320 digits, the 52nd known Mersenne prime, found by Luke Durant via the GIMPS project on October 12, 2024). The number-theoretic foundation of Lucas-Lehmer is what Euler wrote down in 1772.


6.1.8 Quadratic reciprocity (left as an open problem) — E10 (§4 of this episode)

See §4 of this blog post for details. Euler wrote it in 1772 and printed it in 1783 in Opuscula analytica vol I (E552, that is, in the last year of his life), explicitly stating the law of quadratic reciprocity, including the supplementary laws, but did not give a complete proof. 13 years later (1796), the 19-year-old Carl Friedrich Gauss gave the first proof. Over his lifetime Gauss gave 8 different proofs of this theorem.

Modern significance: the starting point of class field theory. Artin reciprocity (1927) generalized this quadratic form of Euler-Gauss to arbitrary finite-dimensional abelian extensions of Q\mathbb{Q}. The Langlands program (1967-) pushed reciprocity further into the non-abelian. Elliptic-curve cryptography (ECC) is also, to some extent, an application of the idea of reciprocity.


§6.2 Graph theory + combinatorics — 3 items

6.2.1 The seven bridges of Königsberg → graph theory — E04

Euler 1735 (E053, printed 1741):

On the Pregel river in the center of Königsberg (today Kaliningrad) there were 7 bridges connecting 4 pieces of land. The question: can one, in a single walk, cross every bridge once and only once?

Euler abstracted each piece of land as a node (vertex) and each bridge as an edge, obtaining a multigraph G=(V,E)G = (V, E) with ∣V∣=4,∣E∣=7|V| = 4, |E| = 7.

Euler’s theorem (the first theorem of graph theory): a connected multigraph has an Eulerian path (a path that passes through every edge exactly once) if and only if the number of vertices of odd degree is exactly 0 or 2.

All 4 vertices of Königsberg have odd degree (3, 3, 3, 5), so there is no Eulerian path. The answer: impossible.

Modern significance: graph theory was born from this as a branch of mathematics. Modern applications: shortest paths in road networks (Dijkstra), circuit routing, NP problems (Hamiltonian path is NP-complete vs Eulerian path is in P), social network analysis.


6.2.2 The knight’s tour — E09

Euler 1758 (E309, printed 1766, delayed due to the Seven Years’ War):

The chess knight moves in an L shape — 2+1 steps. The question: can it visit every square of an 8×88 \times 8 board exactly once (open tour), or return to the starting point (closed tour)?

Euler used divide-and-conquer: split the 8×88 \times 8 into 4 4×44 \times 4 sub-boards, find local tours within each sub-board, and use a few key moves to join the local tours into a global one.

Euler gave several complete closed-tour solutions.

Modern significance: the knight’s tour is an early concrete form of the Hamiltonian path problem (only generalized by Hamilton in 1857). The Hamiltonian path in the general case is NP-complete (Karp 1972) — which means there is no known polynomial-time algorithm. Modern successors: the traveling salesman problem (TSP), chip routing, path optimization.


6.2.3 Latin squares + the 36 officers — E10 (§3 of this episode)

See §3 of this blog post for details. Euler in 1779 (E530) posed the 36 officers problem, which in modern terms is: find a pair of 6×66 \times 6 orthogonal Latin squares. Euler tried everything and could not find one, and conjectured: for n≡2(mod4)n \equiv 2 \pmod 4 (that is, n=2,6,10,14,…n = 2, 6, 10, 14, \ldots) none exists.

178 years later (1959-60), the three collaborators Bose / Shrikhande / Parker disproved it: the n≥10n \geq 10 part is all wrong. Euler’s intuition was right only for n=2n = 2 and n=6n = 6.

Modern significance: it launched the discipline of combinatorial design theory. Fisher in 1925 used Latin squares for block designs in agricultural experiments — still today a standard method of statistical experimental design. Reed-Solomon coding (the error-correction basis of CD/DVD/QR codes) also uses the algebraic structure of Latin squares.


§6.3 Complex variables + analysis — 2 items

6.3.1 eix=cos⁡x+isin⁡xe^{ix} = \cos x + i \sin x — E07

Euler 1748 (E101 Introductio in analysin infinitorum vol. I, §138):

eix=cos⁡x+isin⁡xfor all x∈R.e^{ix} = \cos x + i \sin x \quad \text{for all } x \in \mathbb{R}.

Proof: use power series (Taylor expansion). We know ez=∑zn/n!e^z = \sum z^n / n!, cos⁡x=∑(−1)nx2n/(2n)!\cos x = \sum (-1)^n x^{2n}/(2n)!, sin⁡x=∑(−1)nx2n+1/(2n+1)!\sin x = \sum (-1)^n x^{2n+1}/(2n+1)!. Substitute z=ixz = ix into the expansion of eze^z, split into real and imaginary parts, and you immediately get cos⁡x+isin⁡x\cos x + i \sin x.

This identity unifies the exponential function and the trigonometric functions — in the complex plane eixe^{ix} travels along the unit circle, and its real and imaginary parts are cos and sin respectively.

Modern significance: the mathematical foundation of the whole FFT (Fast Fourier Transform). Digital signal processing (DSP), quantum-mechanical wave functions (ψ(x,t)=ei(kx−ωt)\psi(x,t) = e^{i(kx-\omega t)}), AC circuit analysis (phasors), the path integral of quantum field theory ∫eiS/ℏ\int e^{iS/\hbar} — all are built on this one identity.


6.3.2 Euler’s identity eiπ+1=0e^{i\pi} + 1 = 0 — E07

Euler 1748 (E101 Introductio, a special case of §138):

eiπ+1=0e^{i\pi} + 1 = 0

Substitute x=πx = \pi into the previous identity (eiπ=cos⁡π+isin⁡π=−1+0i=−1e^{i\pi} = \cos\pi + i\sin\pi = -1 + 0i = -1) and move the term across.

This identity connects 5 of the most important constants in mathematics: 0,1,e,i,π0, 1, e, i, \pi. And it uses the three basic operations of addition + multiplication + exponentiation. So beautiful that it does not look like a mathematical result.

Modern significance: equivalent to §6.3.1, but with a different emotional impact. Called by Feynman “the most remarkable formula in mathematics”. It is the hero formula of almost every popular mathematics book.


§6.4 Calculus of variations + mechanics — 5 items

6.4.1 The brachistochrone (curve of fastest descent) — E06

Question posed by Johann Bernoulli in 1696, solved independently by Newton / Leibniz / Jakob Bernoulli / Euler:

A bead slides from point AA along a frictionless curve to point BB; which curve makes the time of descent shortest?

The answer is the cycloid. Not a straight line, not a parabola — but a cycloid.

Bernoulli in 1696 solved it by analogy with optics (Snell’s law of refraction). Newton finished it in one night. Euler in 1744 (E065) generalized this problem, bringing out the calculus of variations as an independent branch of mathematics.

Modern significance: the calculus of variations is a basic tool of classical mechanics (Lagrangian / Hamiltonian), general relativity (the Hilbert action), and quantum field theory (the path integral).


6.4.2 The Euler-Lagrange equation — E06

Euler 1744 (E065) + Lagrange’s 1755 rewriting:

If we want to find, for the functional S[y]=∫abL(y,y′,x) dxS[y] = \int_a^b L(y, y', x) \, dx, the function that makes it take an extremum, y(x)y(x), then yy must satisfy:

∂L∂y−ddx∂L∂y′=0.\frac{\partial L}{\partial y} - \frac{d}{dx} \frac{\partial L}{\partial y'} = 0.

This is the fundamental equation of the calculus of variations. The brachistochrone (§6.4.1) is one concrete application of it.

Lagrange in 1755 (at 19) wrote to Euler, re-deriving this equation with a more algebraic, less geometric method. After reading it, Euler generously held back his own version from publication, letting the young Lagrange’s name come out first. Later this equation came to be called Euler-Lagrange.

Modern significance: the Lagrangian form of classical mechanics: L=T−VL = T - V (kinetic energy minus potential energy), with every particle coordinate satisfying Euler-Lagrange. Generalized to fields: the Lagrangian density L\mathcal{L} of quantum field theory. Noether in 1915 translated the symmetries of Euler-Lagrange into conservation laws (Noether’s theorem). Almost every theory of modern physics starts from an action principle δS=0\delta S = 0.


6.4.3 Euler’s fluid equations — E09

Euler 1753 (written) / 1761 (printed, E258, Principia motus fluidorum):

The equation of motion of an incompressible inviscid fluid:

∂tv+(v⋅∇)v=−1ρ∇p+g\partial_t \mathbf{v} + (\mathbf{v} \cdot \nabla) \mathbf{v} = -\frac{1}{\rho}\nabla p + \mathbf{g}

plus the continuity equation ∇⋅v=0\nabla \cdot \mathbf{v} = 0 (incompressible). Here v(r,t)\mathbf{v}(\mathbf{r}, t) is the velocity field, pp the pressure, ρ\rho the density, g\mathbf{g} gravity.

This is the ancestral equation of fluid dynamics. Before Euler wrote it down in 1753 (printed 1761), fluids could only be discussed qualitatively. Euler treated the fluid as a continuous medium (continuum) and described it with partial differential equations.

Modern significance: adding the viscous term μ∇2v\mu \nabla^2 \mathbf{v} gives Navier-Stokes (1822). Modern uses: flow around aircraft, weather forecasting (numerical solution of Navier-Stokes), climate models, cardiovascular blood flow, rocket propulsion, ocean currents. Millennium Prize problem: the existence and smoothness of Navier-Stokes in three dimensions is unsolved to this day (2026), one of the Clay Institute’s 1-million-dollar prizes.


6.4.4 Euler angles — E09

Euler 1751-1758 (E177 + E292), complete version 1765 (E289 Theoria motus corporum solidorum):

Any three-dimensional orientation can be described by three independent angle parameters. Standard convention (3-1-3): first rotate about the zz-axis by ϕ\phi, then about the new xx-axis by θ\theta, and finally about the once-again new zz-axis by ψ\psi.

This can be written with rotation matrices:

R(ϕ,θ,ψ)=Rz(ψ)Rx(θ)Rz(ϕ).R(\phi, \theta, \psi) = R_z(\psi) R_x(\theta) R_z(\phi).

Euler’s rotation theorem (E478, 1775): any rotation of a rigid body about a fixed point can be equivalently regarded as a single rotation about some instantaneous axis.

Modern significance: spacecraft attitude control, satellite pointing, gyroscopes, inertial navigation (INS), attitude stabilization of aircraft/missiles, robot arms (robot arm forward/inverse kinematics), virtual reality head tracking (VR headtracking), computer graphics (3D rotation in OpenGL/DirectX). The limitation of Euler angles (gimbal lock) has been replaced in modern graphics by quaternions, but quaternions too extend from the geometric foundations of Euler angles.


6.4.5 The Lagrange points L1L_1-L5L_5 — E10 (§1 of this episode)

See §1 of this blog post for details. Euler (E327, written 1763, published 1767) found the three collinear points L1,L2,L3L_1, L_2, L_3. Lagrange in 1772 (Paris Academy Prize) added the two equilateral-triangle points L4,L5L_4, L_5.

Modern significance: NASA’s James Webb Space Telescope is at the Earth-Sun L2L_2 point (1.5 million km from the Earth in the direction away from the Sun, arrived January 24, 2022). The SOHO solar observation satellite is at the L1L_1 point. The STEREO and DART missions use L4/L5L_4 / L_5. The Sun-Jupiter L4/L5L_4 / L_5 actually gather 12,000+ Trojan asteroids; Lagrange in 1772 thought these two points had no physical realization, which 200 years later was proved wrong.


§6.5 Topology — 1 item (hero panel)

6.5.1 The polyhedron formula V−E+F=2V - E + F = 2 — E09

Euler 1750 (E230, letter to Goldbach of 1750-11-14):

For any convex polyhedron:

V−E+F=2V - E + F = 2

where VV = number of vertices, EE = number of edges, FF = number of faces.

Check: | Polyhedron | VV | EE | FF | V−E+FV-E+F | |---|---|---|---|---| | tetrahedron | 4 | 6 | 4 | 2 | | cube | 8 | 12 | 6 | 2 | | octahedron | 6 | 12 | 8 | 2 | | dodecahedron | 20 | 30 | 12 | 2 | | icosahedron | 12 | 30 | 20 | 2 |

Euler announced it in his letter to Goldbach of 1750-11-14 (E230), and in 1751 gave a draft proof by induction on edges (E231, printed 1758). Cauchy in 1813 gave a more rigorous version.

At a deeper level: the number χ=V−E+F\chi = V - E + F is a topological invariant — it does not depend on the specific shape of the polyhedron, only on its “topological type”. For the sphere χ=2\chi = 2; for the torus χ=0\chi = 0; for a general genus-gg surface χ=2−2g\chi = 2 - 2g.

This is the first example of a topological invariant. The core idea of all of algebraic topology (Poincaré 1900, Brouwer 1911, de Rham 1931, Hodge 1941, Atiyah-Singer 1963) — “use algebraic objects to capture the invariance of geometric shape” — begins with this formula of Euler’s from 1750-58.

Modern significance: the whole discipline of topology. Applications: Calabi-Yau manifolds (string theory), Chern classes (gauge field theory), the Atiyah-Singer index theorem (differential geometry + number theory + operator algebras), persistent homology (topological data analysis, TDA).


§6.6 Summary: 30+ Euler-named concepts

The 19 we have walked through are a small part, the part with the most currency, of the mathematical results prefixed with Euler’s name. The List of things named after Leonhard Euler (collected by Wikipedia) currently has 100+ entries, including but not limited to:

When people in mathematics and physics see the name “Euler” in the literature, they generally have to disambiguate it — because it might refer to 10 different results. This itself is the currency left by Euler’s 76 years / 866 papers.

From the E01 prologue to the E10 finale, the timeobserver137 series ends here.


— Escher · §6 RETROSPECTIVE · v0 · 2026-05-26