Difference between revisions of "2025 AIME I Problems/Problem 5"
m (→Solution 3) |
m (→Solution 3) |
||
Line 46: | Line 46: | ||
Let <math>waxbyczn</math> be our 8 digit number. For a number to be a multiple of <math>22</math> it must be an even multiple of <math>11,</math> so <math>n</math> must be even and <math>|(w + x + y + z) - (a + b + c)| = 11x</math> for <math>x \geq 0</math>. If we let <math>n = 8,</math> we have three main subcases: | Let <math>waxbyczn</math> be our 8 digit number. For a number to be a multiple of <math>22</math> it must be an even multiple of <math>11,</math> so <math>n</math> must be even and <math>|(w + x + y + z) - (a + b + c)| = 11x</math> for <math>x \geq 0</math>. If we let <math>n = 8,</math> we have three main subcases: | ||
− | SC1: <math>a + b + c + 8 = w + x + y + z</math> | + | * SC1: <math>a + b + c + 8 = w + x + y + z.</math> |
+ | |||
Note that none of the variables can be <math>8</math> since <math>n</math> is <math>8</math>. We know that <math>(a + b + c) + (w + x + y + z) = 36 - 8 = 28</math> and <math>(a + b + c) + 8 = (w + x + y + z).</math> Solving, we find <math>a + b + c = 10</math> and <math>w + x + y + z = 18.</math> After some small bashing we find there are <math>4</math> combinations of numbers that will work: | Note that none of the variables can be <math>8</math> since <math>n</math> is <math>8</math>. We know that <math>(a + b + c) + (w + x + y + z) = 36 - 8 = 28</math> and <math>(a + b + c) + 8 = (w + x + y + z).</math> Solving, we find <math>a + b + c = 10</math> and <math>w + x + y + z = 18.</math> After some small bashing we find there are <math>4</math> combinations of numbers that will work: | ||
The variables <math>a, b, c</math> can be distinct elements the sets <math>{2, 3, 5}, {1, 4, 5}, {1, 3, 6}</math> or <math>{1, 2, 7}</math>, and <math>w, x, y, z</math> can be distinct elements of each corresponding set. (So for example, if we chose <math>a, b, c</math> from <math>{2, 3, 5}</math> we would choose <math>w, x, y, z</math> from <math>{1, 4, 6, 7}.</math>) There are <math>4</math> different set pairs, <math>3!</math> ways to permute <math>a, b, c,</math> and <math>4!</math> ways to permute <math>w, x, y, z,</math> giving us <math>4! \cdot 3! \cdot 4</math> ways for this subcase. | The variables <math>a, b, c</math> can be distinct elements the sets <math>{2, 3, 5}, {1, 4, 5}, {1, 3, 6}</math> or <math>{1, 2, 7}</math>, and <math>w, x, y, z</math> can be distinct elements of each corresponding set. (So for example, if we chose <math>a, b, c</math> from <math>{2, 3, 5}</math> we would choose <math>w, x, y, z</math> from <math>{1, 4, 6, 7}.</math>) There are <math>4</math> different set pairs, <math>3!</math> ways to permute <math>a, b, c,</math> and <math>4!</math> ways to permute <math>w, x, y, z,</math> giving us <math>4! \cdot 3! \cdot 4</math> ways for this subcase. | ||
− | SC2: <math>a + b + c + 19 = w + x + y + z</math> | + | * SC2: <math>a + b + c + 19 = w + x + y + z.</math> |
+ | |||
<math>19</math> is odd, so if we set up our system of equations for <math>(a + b + c)</math> and <math>(w + x + y + z)</math> like we did in subcase 1, we would end up with a fraction. | <math>19</math> is odd, so if we set up our system of equations for <math>(a + b + c)</math> and <math>(w + x + y + z)</math> like we did in subcase 1, we would end up with a fraction. | ||
− | SC3: <math>a + b + c - 3 = w + x + y + z</math> | + | * SC3: <math>a + b + c - 3 = w + x + y + z.</math> |
Same issue as subcase 2, we will end up with a fraction because <math>3</math> is odd. | Same issue as subcase 2, we will end up with a fraction because <math>3</math> is odd. | ||
Revision as of 21:07, 13 July 2025
Contents
Problem
There are eight-digit positive integers that use each of the digits
exactly once. Let
be the number of these integers that are divisible by
. Find the difference between
and
.
Solution 1
Notice that if the 8-digit number is divisible by , it must have an even units digit. Therefore, we can break it up into cases and let the last digit be either
or
. Due to symmetry, upon finding the total count of one of these last digit cases (we look at last digit
here), we may multiply the resulting value by
.
Now, we just need to find the number of positions of the remaining numbers such that the units digit is and the number is divisible by
. Denote the odd numbered positions to be
and the even numbered positions to be
(recall
). By the divisibility rule of
, we must have:
which is congruent to
. Therefore, after simplifying, we must have:
Now consider
. Therefore,
which means that
Notice that the minimum of
is
and the maximum is
. The only possible number congruent to
in this range is
. All that remains is to count all the possible sums of
using the values
. There are a total of four possibilities:
The arrangement of the odd-positioned numbers (
) does not matter, so there are
arrangements of these numbers. Recall that the
triplets above occupy
; the number of arrangements is
. Thus, we have
possible numbers such that the units digit is
. Since we claimed symmetry over the rest of the units digits, we must multiply by
, resulting in
eight-digit positive integers. Thus, the positive difference between
and
is
.
~ilikemath247365
~LaTeX by eevee9406
Solution 2
1. To be multiple of
Total of
is
dividing into two groups of
numbers, the difference of sum of two group
and
need to be
or multiple of
i.e.
only
is possible.
Number
can only be with
One group of
numbers make
different arrangement, two groups make
the
group makes
arrangement. The two group of numbers are alternating by digits.
Total number of multiple of
is
2. To be multiple of
We noticed in each number group, there are two odd two even.
So the final answer is above divided by
~Mathzu.club ~Latex by mathkiddus
Solution 3
Let
be our 8 digit number. For a number to be a multiple of
it must be an even multiple of
so
must be even and
for
. If we let
we have three main subcases:
- SC1:
Note that none of the variables can be since
is
. We know that
and
Solving, we find
and
After some small bashing we find there are
combinations of numbers that will work:
The variables
can be distinct elements the sets
or
, and
can be distinct elements of each corresponding set. (So for example, if we chose
from
we would choose
from
) There are
different set pairs,
ways to permute
and
ways to permute
giving us
ways for this subcase.
- SC2:
is odd, so if we set up our system of equations for
and
like we did in subcase 1, we would end up with a fraction.
- SC3:
Same issue as subcase 2, we will end up with a fraction because is odd.
Now, note that no matter what we choose to be, there will always be
ways for SC1 and
ways for SC2 and SC3. Since
can be
different values, the answer is just
Video Solution by SpreadTheMathLove
https://www.youtube.com/watch?v=P6siafb6rsI
(also the person in the Youtube video wrote the final answer wrong, it was supposed to be 279 and he accidentally wrote it as 729)
~Mathycoder
See also
2025 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 4 |
Followed by Problem 6 | |
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, as part of the American Mathematics Competitions.