2010 AIME I Problems/Problem 2
Revision as of 07:06, 11 February 2023 by Savannahsolver (talk | contribs)
Contents
Problem
Find the remainder when is divided by .
Solution
Note that (see modular arithmetic). That is a total of integers, so all those integers multiplied out are congruent to . Thus, the entire expression is congruent to .
Video Solution by OmegaLearn
https://youtu.be/orrw4VydBTk?t=140
~ pi_is_3.14
Video Solution
https://www.youtube.com/watch?v=-GD-wvY1ADE&t=78s
Video Solution by WhyMath
~savannahsolver
See Also
2010 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 1 |
Followed by Problem 3 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.