Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-28T07:41:32.883Z Has data issue: false hasContentIssue false

4. On Fermat's Theorem

Published online by Cambridge University Press:  15 September 2014

Get access

Extract

The author stated that in consequence of Legendre's work, the proof of Fermat's Theorem is reducible to showing the impossibility of

xm = ym+zm,

when m is an odd prime, x, y, z being integers.

Talbot has shown that in this case x, y, z are necessarily composite numbers.

The author shows, among other results of very elementary processes, that if numbers can be found to satisfy the above equation, x and y leave the remainder 1 when divided by m; and that z has m as a factor. Many farther limitations are given on possible values of x, y, z—the process being based on the consideration of their prime factors, and on Fermat's Elementary Theorem Nm − N = Nm.

Type
Proceedings 1863-64
Copyright
Copyright © Royal Society of Edinburgh 1866

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)