Difference between revisions of "2021 AIME II Problems/Problem 3"
MRENTHUSIASM (talk | contribs) m (→Solution 2) |
Arnigam2007 (talk | contribs) (→Solution 2) |
||
Line 15: | Line 15: | ||
~MRENTHUSIASM | ~MRENTHUSIASM | ||
+ | |||
+ | ==Solution 3== | ||
==See also== | ==See also== | ||
{{AIME box|year=2021|n=II|num-b=2|num-a=4}} | {{AIME box|year=2021|n=II|num-b=2|num-a=4}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 01:41, 23 March 2021
Contents
[hide]Problem
Find the number of permutations of numbers
such that the sum of five products
Solution 1
Since is one of the numbers, a product with a
in it is automatically divisible by
, so WLOG
, we will multiply by
afterward since any of
would be
, after some cancelation we see that now all we need to find is the number of ways that
is divisible by
, since
is never divisible by
, now we just need to find the number of ways
is divisible by
, after some calculation you will see that there are
ways to choose
and
in this way. So the desired answer is
.
~ math31415926535
Solution 2
The expression has cyclic symmetry. Without the loss of generality, let
It follows that
We have
are congruent to
in some order.
I am on my way. No edit please. A million thanks.
~MRENTHUSIASM
Solution 3
See also
2021 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
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.