1988 AIME Problems/Problem 9: Difference between revisions
No edit summary |
|||
| Line 5: | Line 5: | ||
A little bit of checking tells us that the units digit must be 2. Now our cube must be in the form of <math>(10k + 2)^3</math>; using the [[binomial theorem]] gives us <math>1000k^3 + 600k^2 + 120k + 8</math>. Since we are looking for the tens digit, <math>\mod{100}</math> we get <math>20k + 8 \equiv 88 \pmod{100}</math>. This is true if the tens digit is either <math>4</math> or <math>9</math>. Casework: | A little bit of checking tells us that the units digit must be 2. Now our cube must be in the form of <math>(10k + 2)^3</math>; using the [[binomial theorem]] gives us <math>1000k^3 + 600k^2 + 120k + 8</math>. Since we are looking for the tens digit, <math>\mod{100}</math> we get <math>20k + 8 \equiv 88 \pmod{100}</math>. This is true if the tens digit is either <math>4</math> or <math>9</math>. Casework: | ||
*<math>4</math>: Then our cube must be in the form of <math>(100k + 42)^3 \equiv 3(100k)(42)^2 + 42^3 \equiv 200k + 88 \pmod{1000}</math>. Hence the lowest possible value for the hundreds digit is <math>4</math>, and so <math>442</math> is a valid solution. | *<math>4</math>: Then our cube must be in the form of <math>(100k + 42)^3 \equiv 3(100k)(42)^2 + 42^3 \equiv 200k + 88 \pmod{1000}</math>. Hence the lowest possible value for the hundreds digit is <math>4</math>, and so <math>442</math> is a valid solution. | ||
*<math>9</math>: Then our cube is <math>(100k + 92)^3 \equiv 3(100k)(92)^2 + 92^3 \equiv 200k + 688 \pmod{1000}</math>. The lowest possible value for the hundreds digit is <math>1</math>, and we get <math>192</math>, | *<math>9</math>: Then our cube is <math>(100k + 92)^3 \equiv 3(100k)(92)^2 + 92^3 \equiv 200k + 688 \pmod{1000}</math>. The lowest possible value for the hundreds digit is <math>1</math>, and we get <math>192</math>. Hence, since <math>192 < 442</math>, the answer is <math>\fbox{192}</math> | ||
== See also == | == See also == | ||
Revision as of 00:42, 9 September 2016
Problem
Find the smallest positive integer whose cube ends in 
.
Solution
A little bit of checking tells us that the units digit must be 2. Now our cube must be in the form of 
; using the binomial theorem gives us 
. Since we are looking for the tens digit, 
we get 
. This is true if the tens digit is either 
or 
. Casework:
: Then our cube must be in the form of 
. Hence the lowest possible value for the hundreds digit is , and so 
is a valid solution.
: Then our cube is 
. The lowest possible value for the hundreds digit is 
, and we get 
. Hence, since 
, the answer is 
. Hence the lowest possible value for the hundreds digit is 
is a valid solution.
. The lowest possible value for the hundreds digit is 
, and we get 
. Hence, since 
, the answer is 
See also
| 1988 AIME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 8 |
Followed by Problem 10 | |
| 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. Error creating thumbnail: File missing
