¡@
java Programming Glossary: fermatCalculating and printing the nth prime number http://stackoverflow.com/questions/9625663/calculating-and-printing-the-nth-prime-number such property is associated with the name of Pierre de Fermat who in the early 17 th century found that If p is a prime then.. p is a prime then p is a divisor of a p a for all a . This Fermat's so called 'little theorem' is in the equivalent formulation.. Composite numbers n such that a^ n 1 1 mod n are called Fermat pseudoprimes for the base a . But such occurrences are rare...
|