Homework Sourseuse fermats little theorem show that if p is prime and a is
use fermats little theorem
show that if p is prime and a is an integer, then p I [ap + (p-1) ! a]
Solution
The statement given above is not true. For example,
Take a=2 and p=7,a prime number.
Now, [ap+(p-1)!a] = [2.7 + (7-1)!.2] = [14 + 6!.2] = [14+720.2] = [14+1440] = 1454 , which is not divisible by 7.
![use fermats little theorem show that if p is prime and a is an integer, then p I [ap + (p-1) ! a]SolutionThe statement given above is not true. For example, Tak](/WebImages/44/use-fermats-little-theorem-show-that-if-p-is-prime-and-a-is-1139799-1761611057-0.webp "use fermats little theorem show that if p is prime and a is an integer, then p I [ap + (p-1) ! a]SolutionThe statement given above is not true. For example, Tak")
