该博客介绍了如何寻找奇素数的原根，即找到使得1到p-1每个数与其模p乘积不同的最小正整数。文章通过欧拉函数和筛选法展示了计算原根数量的方法，并提供了一个C++实现的代码示例，用于读取奇素数p并输出其原根的数量。
Primitive Roots
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 1279 | Accepted: 629 |
Description
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 a primitive root modulo 7.
Write a program which given any odd prime 3 <= p < 65536 outputs the number of primitive roots modulo p.
Write a program which given any odd prime 3 <= p < 65536 outputs the number of primitive roots modulo p.
Input
Each line of the input contains an odd prime numbe
最低0.47元/天 解锁文章
652
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
