- #1

MathematicalPhysicist

Gold Member

- 4,699

- 369

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.