how can I prove that 29341 is not a prime number, with Fermat

69 Views Asked by At
1

There are 1 best solutions below

1
On BEST ANSWER

Here is a Hint:

You can use Fermats Little Theorem. Which says $$ a^{p-1}\equiv \cases{1 \ \ (\bmod p) \ \ if \ \ p\nmid a\\ 0 \ \ (\bmod p) \ \ if \ \ p\mid a} $$ where $p$ is a prime and $a$ is any integer.

Hope this helps and this is what you meant.