Consider the quadratic congruence equation ….(1)…. where is an odd prime and is a positive integer relatively prime to . If this equation has solutions, then we say that is a quadratic residue modulo . If this equation has no … Continue reading →| Exploring Number Theory
If the modulus is small and if primitive roots modulo exist, finding primitive roots can be a simple matter. In such cases, we can simply try out all possible candidate primitive roots. For large , there is no easy or … Continue reading →| Exploring Number Theory