Let Z/nZ denote the set of integers considered modulo n (hence Z/nZ has n elements). Find all positive integers for which there exists a bijective function , such that the 101 functions
are all bijections on .
n
g:Z/nZ→Z/nZ
g(x),g(x)+x,g(x)+2x,…,g(x)+100x
Z/nZ
Ashwin Sah and Yang Liu
MathematicsHardAoPS Forum #112
AAll n with gcd(n,100!)=1
BAll n with gcd(n,101)=1
CAll n with gcd(n,101!)=1
DAll n>101
EAll primes n>101
Sign in to check your answer and unlock the solution.