SearcharxivSearch

arXiv · 1904.03553

Germain and Her Fearless Attempt to Prove Fermat's Last Theorem

Abstract

Two centuries ago, Sophie Germain began to work on her grand plan to prove the theorem of Fermat, the famous conjecture that $x^n + y^n = z^n$ is impossible for nonzero integral values of $x$, $y$, and $z$, when $n > 2$. At that time, this was an open question since nobody knew whether Fermat's assertion was true. Euler had proved it for $n = 3$ and $n = 4$. However, no one else had demonstrated the general case. Then Sophie Germain valiantly entered the world of mathematics in 1804, reaching out to Gauss (writing under the assumed name Monsieur Le Blanc) boldly stating that she could do it. Eventually, Germain conceived a formidable plan for proving Fermat's Last Theorem in its entirety, and in the process she obtained proofs of Case 1 for particular families of exponents. Her efforts resulted in Sophie Germain's Theorem that proves Case 1 of FLT for an odd prime exponent $p$ whenever $2p + 1$ is prime. Today, a prime $p$ is called a Sophie Germain prime if $2p + 1$ is also prime. It remains an unanswered question whether there are an infinite number of Sophie Germain primes. But there is more that Germain did in number theory, much of which was veiled by the mathematicians with whom she shared her work. This article provides historical details of Sophie Germain's efforts, written with the sole intention of paying homage to the only woman mathematician who contributed to proving the most famous assertion of Fermat.

Explore related subjects

Keep this discovery

BibTeXRIS

Dora Musielak. 2019-04-07. Germain and Her Fearless Attempt to Prove Fermat's Last Theorem. https://arxiv.org/abs/1904.03553

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO