Fermat, Euler, and Pseudoprimes
We have reduced the problem of finding even perfect numbers to deciding when M(p) = 2 P — 1 is prime. Algorithm 2.9 is a very recent development. In this chapter we will be starting with some progress made by Pierre de Fermat (1601-1665) in 1640.
KeywordsPrime Divisor Binary Representation Primality Test Small Divisor Distinct Integer
Unable to display preview. Download preview PDF.