i read the book "the man who loved only numbers" by paul hoffman, and there is explanation about fermat's test for checking prime numbers which states: if n is prime then for every whole number a the number a^n-a is a multiple of n.(adsbygoogle = window.adsbygoogle || []).push({});

now my question is about a pseduo prime number which "fools" this test how could you find such a number, i mean you should check every a wich is ofcourse infinite numbers how could you possibly know that n is pseduo prime number by not checking every a?

btw the smallest p.p number is 561.

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Fermat test

Loading...

Similar Threads - Fermat test | Date |
---|---|

I Fermat's Little Theorem ... Anderson and Feil, Theorem 8.7 . | Feb 26, 2017 |

Fermat Numbers - Factor Form Proof | Nov 14, 2012 |

Question on Fermat's Last Theorem | Aug 17, 2012 |

Is this a short, marvelous proof of Fermat's Last Theorem? | Jul 21, 2012 |

A primality test for Fermat numbers faster than Pépin's test ? | Oct 26, 2004 |

**Physics Forums - The Fusion of Science and Community**