In this post we discuss a beautiful connection between Fermat’s little theorem and the solvability of a quadratic congruence equation. The discussion leads to a theorem that is commonly calle…| Exploring Number Theory
In some cryptography applications such as RSA algorithm, it is necessary to compute $latex \displaystyle a^w$ modulo $latex m$ where the power $latex w$ and the modulus $latex m$ are very large num…| Exploring Number Theory
The preceding two posts derive several supplements to the law of quadratic reciprocity (links are given below). We gather all the derived information in one post so that we have everything in one p…| Exploring Number Theory