Discussion-fermats little theorem

Question

Question:

Fermat's Little theorem

Please DO NOT USE Euler's function. You can only use Fermat's Little theorem if needed.

Problem:

Prove that if p is prime and (a,p)=1 , then the congruence ax = b (mod p) has the solution

x = a^(p-2) b (mod p)