MathDB
2018 Fall Team #7

Source:

April 17, 2022
number theory

Problem Statement

For a positive number nn, let g(n)g(n) be the product of all 1≤k≤n1 \le k \le n such that gcd (k,n)=1(k, n) =1, and say that n>1n > 1 is reckless if nn is odd and g(n)≡−1g(n) \equiv -1 (mod nn). Find the number of reckless numbers less than 5050.
Back to ProblemsView on AoPS