2021 Fall AMC 12A Problems/Problem 4: Difference between revisions
| Line 55: | Line 55: | ||
~wamofan | ~wamofan | ||
==Sidenote== | |||
The divisibility test for <math>11</math> is if the difference between the sum of the alternating digits is <math>0</math> or <math>11</math>, then that number is divisible by <math>11</math>. For <math>202103</math>, we have <math>2</math>+<math>2</math>-<math>1</math>-<math>3</math>=<math>0</math>. | |||
For <math>7</math>, the divisibility test can be slow. Take the last digit, double it, and subtract it from the rest of the number. If it is divisible by <math>7</math>, then the original number is divisible by <math>7</math>. If the number is too large to determine whether or not it is a multiple of <math>7</math>, then we repeat the process until we can determine whether or not the number is divisible by <math>7</math>. | |||
~Yvz2900 | |||
==Video Solution (Simple and Quick)== | ==Video Solution (Simple and Quick)== | ||
Latest revision as of 17:37, 1 November 2025
- The following problem is from both the 2021 Fall AMC 10A #5 and 2021 Fall AMC 12A #4, so both problems redirect to this page.
Problem
The six-digit number
is prime for only one digit
What is
Solution 1
First, modulo
or
,
.
Hence,
.
Second modulo
,
.
Hence,
.
Third, modulo
,
.
Hence,
.
Therefore, the answer is
.
~NH14 ~Steven Chen (www.professorchenedu.com)
Solution 2 (Elimination)
Any number ending in
is divisible by
. So we can eliminate option
.
If the sum of the digits of a number is divisible by
, the number is divisible by
. The sum of the digits of this number is
. If
is divisible by
, the number is divisible by
. Thus we can eliminate options
and
.
So the correct option is either
or
. Let's try dividing the number with some integers.
, where
is
. Since
and
are both indivisible by
, this does not help us narrow the choices down.
, where
is
. Since
, option
would make
divisible by
. Thus, by elimination, the correct choice must be option
.
~ZoBro23
Solution 3
divisible by
.
divisible by
.
divisible by
.
divisible by
.
divisible by
.
divisible by
.
divisible by
.
divisible by
.
divisible by
.
This leaves only
.
~wamofan
Sidenote
The divisibility test for
is if the difference between the sum of the alternating digits is
or
, then that number is divisible by
. For
, we have
+
-
-
=
.
For
, the divisibility test can be slow. Take the last digit, double it, and subtract it from the rest of the number. If it is divisible by
, then the original number is divisible by
. If the number is too large to determine whether or not it is a multiple of
, then we repeat the process until we can determine whether or not the number is divisible by
.
~Yvz2900
Video Solution (Simple and Quick)
~Education, the Study of Everything
Video Solution
~savannahsolver
Video Solution
~Charles3829
Video Solution by TheBeautyofMath
for AMC 10: https://youtu.be/o98vGHAUYjM?t=623
for AMC 12: https://youtu.be/jY-17W6dA3c?t=392
~IceMatrix
Video Solution
~Lucas
Video Solution
~Education, the Study of Everything
See Also
| 2021 Fall AMC 12A (Problems • Answer Key • Resources) | |
| Preceded by Problem 3 |
Followed by Problem 5 |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
| All AMC 12 Problems and Solutions | |
| 2021 Fall AMC 10A (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 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
| All AMC 10 Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: File missing