Ferma's theorem and ferma's Theorem

Ferma's theorem and ferma's Theorem

When p is a prime number, any integer x has xp limit x (mod p). This theorem is called The FeiMa small theorem. Where if x cannot be divisible by p, we have XP-1 limit 1 (mod p ).

After Deformation of this formula, we can get the A-1 mod p (mod p), so we can obtain the multiplication inverse element through the power.

Fast Power-view http://www.cnblogs.com/wls001/p/5157107.html

Multiplication inverse element extension Euclidean method see http://www.cnblogs.com/wls001/p/5157162.html