Difference between revisions of "2022 AIME I Problems/Problem 12"
Oxymoronic15 (talk | contribs) |
|||
Line 1: | Line 1: | ||
− | . | + | .= Problem == |
For any finite set <math>X</math>, let <math>| X |</math> denote the number of elements in <math>X</math>. Define | For any finite set <math>X</math>, let <math>| X |</math> denote the number of elements in <math>X</math>. Define | ||
<cmath> | <cmath> |
Revision as of 22:59, 17 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.