MathDB
Problems
Contests
National and Regional Contests
USA Contests
USA - College-Hosted Events
Princeton University Math Competition
2013 Princeton University Math Competition
4
2013 PUMaC Number Theory B4
2013 PUMaC Number Theory B4
Source:
November 24, 2013
modular arithmetic
Problem Statement
Compute the smallest integer
n
≥
4
n\geq 4
n
≥
4
such that
(
n
4
)
\textstyle\binom n4
(
4
n
)
ends in
4
4
4
or more zeroes (i.e. the rightmost four digits of
(
n
4
)
\textstyle\binom n4
(
4
n
)
are
0000
0000
0000
).
Back to Problems
View on AoPS