MathDB
Problems
Contests
National and Regional Contests
USA Contests
USA - College-Hosted Events
CHMMC problems
2018 CHMMC (Fall)
7
7
Part of
2018 CHMMC (Fall)
Problems
(1)
2018 Fall Team #7
Source:
4/17/2022
For a positive number
n
n
n
, let
g
(
n
)
g(n)
g
(
n
)
be the product of all
1
≤
k
≤
n
1 \le k \le n
1
≤
k
≤
n
such that gcd
(
k
,
n
)
=
1
(k, n) =1
(
k
,
n
)
=
1
, and say that
n
>
1
n > 1
n
>
1
is reckless if
n
n
n
is odd and
g
(
n
)
≡
−
1
g(n) \equiv -1
g
(
n
)
≡
−
1
(mod
n
n
n
). Find the number of reckless numbers less than
50
50
50
.
number theory