- #1
MathematicalPhysicist
Gold Member
- 4,699
- 372
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.
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 which 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.
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 which 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.