Primitive Root（原根）
If 𝑎 has order 𝜙 𝑚 mod 𝑚, we say that 𝑎 is a primitive root mod 𝑚.
Lemma. Let 𝑝 be prime and suppose 𝑞^𝑒|𝑝 − 1 for some other prime 𝑞. Then
there’s an element mod 𝑝 of order 𝑞^𝑒.
Number of primitive roots（原根数量）
The number of primitive roots mod 𝑚 is 𝜙(𝜙(𝑚)) , if there is at least one.
Particularly, if 𝑚 is a prime, then number of primitive roots is 𝜙(𝑚−1) .
有原根的条件：There is a primitive root mod 𝑚 if and only of 𝑚 = 1,2,4, 𝑝^𝑒, 𝑜𝑟 2𝑝^𝑒.(p is prime)
平方剩余（解决平方级别的同余方程）
修正之前的笔误
263
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
