我在RSA学习总结的第三部分关于Mille-Rabin素数测试的正确性证明里需要用到此定理，由于证明太长，故另开一章于此。（为啥我说话突然文绉绉了Orz，可能是这周辩论打多了）
首先证明对任意素数p，modulo p的Primitive Root存在。
以下是证明思路（符号的意思在第二张图，完整证明里有）
知道了modulo p^2下Primitive root存在后可以推广至p^n
时间： 2024-08-05 10:55:34
关于原根的存在性（Primitive Root Theorem）
关于原根的存在性（Primitive Root Theorem）的相关文章
POJ 1284 Primitive Roots （原根）
Primitive Roots Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3219 Accepted: 1858 Description We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (xi mod p) | 1 <= i <= p-1 } is eq
POJ1284---Primitive Roots(求原根个数, 欧拉函数)
Description We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (xi mod p) | 1 <= i <= p-1 } is equal to { 1, -, p-1 }. For example, the consecutive powers of 3 modulo 7 are 3, 2, 6, 4, 5, 1, and t
poj1284——Primitive Roots（欧拉函数）
Description We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (xi mod p) | 1 <= i <= p-1 } is equal to { 1, -, p-1 }. For example, the consecutive powers of 3 modulo 7 are 3, 2, 6, 4, 5, 1, and t
POJ 1284-Primitive Roots(欧拉函数求原根)
Primitive Roots Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 1284 Appoint description: System Crawler (2015-04-06) Description We say that integer x, 0 < x < p, is a primitive root mod
HDU4992 求所有原根
Primitive Roots Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 583 Accepted Submission(s): 144 Problem Description We say that integer x, 0 < x < n, is a primitive root modulo n if and only
poj_1284_Primitive root
We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (x i mod p) | 1 <= i <= p-1 } is equal to { 1, ..., p-1 }. For example, the consecutive powers of 3 modulo 7 are 3, 2, 6, 4, 5, 1, and thus 3 is
POJ 1284 Primitive Roots
Primitive Roots Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 5481 Accepted: 3101 Description We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (xi mod p) | 1 <= i <= p-1 } is eq
求最小原根 51nod 1135
http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1135 代码 // the smallest primitive root of prime P #include <bits/stdc++.h> const long long mod = 1e9+7; const double ex = 1e-10; #define inf 0x3f3f3f3f using namespace std; long long N; i
poj 1284 Primitive Roots（未完）
Primitive Roots Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3155 Accepted: 1817 Description We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (xi mod p) | 1 <= i <= p-1 } is eq