THE ALGORITHM FOR PRIMITIVE ROOTS OF LARGE PRIME NUMBERS

Ⅰ. INTRODUCTION This paper presents two methods for solving the primitive roots of given prime modulus, especially, all the roots of large prime modulus. Since 1801, mathematicians such as Gauss, have researched on this problem, but they all failed in finding any general, explicit and nontentative methods. Thus it remains an unsolved problem though important in the number theory.