2022 AIME I Problems/Problem 12: Difference between revisions
Oxymoronic15 (talk | contribs) No edit summary |
No edit summary |
||
| Line 17: | Line 17: | ||
1000. | 1000. | ||
==Solution== | ==Solution 1 (Easy to Understand)== | ||
Let's try out for small values of <math>n</math> to get a feel for the problem. | |||
==Solution 2 (Rigorous)== | |||
For each element <math>i</math>, denote <math>x_i = \left( x_{i, A}, x_{i, B} \right) \in \left\{ 0 , 1 \right\}^2</math>, where <math>x_{i, A} = \Bbb I \left\{ i \in A \right\}</math> (resp. <math>x_{i, B} = \Bbb I \left\{ i \in B \right\}</math>). | For each element <math>i</math>, denote <math>x_i = \left( x_{i, A}, x_{i, B} \right) \in \left\{ 0 , 1 \right\}^2</math>, where <math>x_{i, A} = \Bbb I \left\{ i \in A \right\}</math> (resp. <math>x_{i, B} = \Bbb I \left\{ i \in B \right\}</math>). | ||
Revision as of 15:39, 21 February 2022
Problem
For any finite set
, let
denote the number of elements in
. Define
where the sum is taken over all ordered pairs
such that
and
are subsets of
with
.
For example,
because the sum is taken over the pairs of subsets
giving
.
Let
, where
and
are relatively prime positive integers. Find the remainder when
is divided by
1000.
Solution 1 (Easy to Understand)
Let's try out for small values of
to get a feel for the problem.
Solution 2 (Rigorous)
For each element
, denote
, where
(resp.
).
Denote
.
Denote
.
Hence,
Therefore,
This is in the lowest term.
Therefore, modulo 1000,
~Steven Chen (www.professorchenedu.com)
See Also
| 2022 AIME I (Problems • Answer Key • Resources) | ||
| Preceded by Problem 11 |
Followed by Problem 13 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America.