Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: 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 { (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. Input Each line of the input contains an odd prime numbers p. Input is terminated by the end-of-file seperator. Output For each p, print a single number that gives the number of primitive roots in a single line. Sample Input 23 31 79 Sample Output 10 8 24 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator