Discussion-fermats little theorem


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)

Solution Preview :

Prepared by a verified Expert
Algebra: Discussion-fermats little theorem
Reference No:- TGS01929713

Now Priced at $20 (50% Discount)

Recommended (91%)

Rated (4.3/5)