20.01.2015 Views

Sophie Germain: mathématicienne extraordinaire - Scripps College

Sophie Germain: mathématicienne extraordinaire - Scripps College

Sophie Germain: mathématicienne extraordinaire - Scripps College

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

And Beyond 68<br />

In 1847, Kummer published a paper which showed that unique factorization<br />

does indeed fail over certain number rings. He then presented a<br />

new type of element, ideals, which he proved do have unique factorization.<br />

This new approach did not lead to a final solution of Fermat’s Last<br />

Theorem, but it created a new branch of mathematics, the field of Algebraic<br />

Number Theory. [6]<br />

Wiles’ Proof (The bare bones).<br />

In 1986, it was found that the Shimura-<br />

Taniyama conjecture on elliptic curves was related to Fermat’s Last Theorem.<br />

Most elliptic curves are give by equations of the form:<br />

E : y 2 = x 3 + ax 2 + bx + c,<br />

where a, b, and c ∈ Q. Elliptic curves have the structure of an abelian group.<br />

That is, given any rational point on the curve, it is possible to find another<br />

rational point, should such points exist. In addition, given a prime p under<br />

certain conditions (i.e., not a bad prime), one can reduce certain elliptic<br />

curves modulo p which produce certain patterns of rational numbers. [23]<br />

In 1993 Andrew Wiles announced his proof of Fermat’s Last Theorem<br />

as a corollary to his proof that semistable elliptic curves exhibit Modularity<br />

Patterns. A result is that certain elliptic curves, in particular, the Frey curve:<br />

E A,B : y 2 = x(x + A p )(x − B p )<br />

must be modular. Ken Ribet had earlier proved that the Frey curve cannot<br />

be modular. A curve cannot be both modular and non-modular, so

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!