Difference between revisions of "2003 AMC 10B Problems/Problem 25"
(remove nonexistent category) |
|||
Line 48: | Line 48: | ||
<math>0 \equiv b+2 \pmod 3 \implies b\equiv 1\pmod 3</math> so <math>b=3c+1 </math> for some integer <math>c</math>. But <math>N = 100b+23 = 100(3c+1)+23</math> so <math>n = 300c+123</math>. Bounding this gives us: | <math>0 \equiv b+2 \pmod 3 \implies b\equiv 1\pmod 3</math> so <math>b=3c+1 </math> for some integer <math>c</math>. But <math>N = 100b+23 = 100(3c+1)+23</math> so <math>n = 300c+123</math>. Bounding this gives us: | ||
<math>999 < 300c+123 < 10000</math> so <math>876 < 300c < 9877</math>. Dividing by <math>300</math> gives <math>2.92 < c < 32.9222</math> so <math>3\le c \le 32</math>. This gives <math>32-3+1 = \boxed{\textbf{(B)} \ 30 }</math> | <math>999 < 300c+123 < 10000</math> so <math>876 < 300c < 9877</math>. Dividing by <math>300</math> gives <math>2.92 < c < 32.9222</math> so <math>3\le c \le 32</math>. This gives <math>32-3+1 = \boxed{\textbf{(B)} \ 30 }</math> | ||
+ | |||
+ | ===Solution 4(extremely fast)=== | ||
+ | |||
+ | The number is in the form <math>xy23</math> | ||
+ | |||
+ | Notice that the number is divisible by <math>3</math> if the sum of the digits of <math>xy23</math> is divisible by <math>3</math> | ||
+ | |||
+ | Our first number that is divisible by <math>3</math> is <math>1023</math>, next is <math>1323</math>.. | ||
+ | Notice <math>xy</math> goes from <math>10\implies 97</math> | ||
+ | |||
+ | Hence, there are <math>\frac{97-10}{3}+1=30</math> distinct four digit numbers. | ||
== See also == | == See also == |
Revision as of 17:26, 9 July 2017
Contents
Problem
How many distinct four-digit numbers are divisible by and have
as their last two digits?
Solution
Solution 1
To test if a number is divisible by three, you add up the digits of the number. If the sum is divisible by three, then the original number is a multiple of three. If the sum is too large, you can repeat the process until you can tell whether it is a multiple of three. This is the basis for the solution. Since the last two digits are , the sum of the digits is
(therefore it is not divisible by three). However certain numbers can be added to make the sum of the digits a multiple of three.
,
, and so on.
However since the largest four-digit number ending with is
, the maximum sum is
.
Using that process we can fairly quickly compile a list of the sum of the first two digits of the number.
Now we find all the two-digit numbers that have any of the sums shown above. We can do this by listing all the two digit numbers in separate cases.
And finally, we add the number of elements in each set.
Solution 2
A number divisible by has all its digits add to a multiple of
The last two digits are
and
and add up to
Therefore the first two digits must add up to
digits (including
) are
are
and
are
The following combinations are equivalent to
:
Let the first term in each combination represent the thousands digit and the second term represent the hundreds digit. We can use this to find the total amount of four-digit numbers.
Solution 3
We have the following: and
. Then
for some integers
and
. Taking mod 3 gives:
so
for some integer
. But
so
. Bounding this gives us:
so
. Dividing by
gives
so
. This gives
Solution 4(extremely fast)
The number is in the form
Notice that the number is divisible by if the sum of the digits of
is divisible by
Our first number that is divisible by is
, next is
..
Notice
goes from
Hence, there are distinct four digit numbers.
See also
2003 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 24 |
Followed by Last problem | |
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.