Given a large prime number P, if you find its original roots? Algorithm description is given. And specific programming functions. Use of random number generation of large prime numbers q, P is of the form 2* q 1 large prime number, P is a prime number, if P is not prime, then regenerate the NCKU prime q, repeat the above steps. Generate random numbers g, 1 <g <p-1, to meet: g ^ 2 mod p! = 1, g ^ q mod p! = 1, then P g is the primitive root.

求原根\readme.txt
......\root.py
求原根

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．