摘要
设n是大于1的奇数,q是n的最小素因数,证明了n-1∑j-1jq-1≡-n/q(modn).利用该结果改进了判别素数的一个充要条件,提出并证明了Giuga猜想的对偶命题.
Let n be an odd number greater than 1, and q the least prime divisor of n. It is proved in this paper that n-1∑j-1jq-1≡-n/q(mod n). The result is used to improve a necessary and sufficient condition of criterionfor primes, and the dual proposition of Giuga's Conjecture is formulated and proved as well.
出处
《温州大学学报(自然科学版)》
2013年第3期1-5,共5页
Journal of Wenzhou University(Natural Science Edition)
关键词
奇素数
Giuga猜想
对偶命题
Property of Primes
Giuga's Conjecture
Dual Proposition