2017 UNCO Math Contest II Problems/Problem 4
Problem
Monkey Business
Harold writes an integer; its right-most digit is 4. When Curious George moves that digit to the far left, the new number is four times the integer that Harold wrote. What is the smallest possible positive integer that Harold could have written?
Solution
Solution 1
Let . When we multiply this number by
, we have
. Multiplying by
,
, which is precisely
. Thus we have
, so the answer is \boxed{102564}
Solution 2
Let denote the number of digits in Harold's integer and x be the remaining part. Then we have the equation
Which simplifies to
This means that
has to be divisible by
(since
is relatively prime to
). But this just tells us that
is the length of the period of
and
is just
times one period of
, or one period of
. But since
is
, so our answer is
Solution 3
We proceed with basic multiplication
_ _ _ _ _ 4 × 4 ——————————— 4 _ _ _ _ _ 4 × 4 = 16 1 _ _ _ _ 6 4 × 4 ——————————— 4 _ _ _ _ 6 4 × 6 = 24 2 1 _ _ _ 5 6 4 × 4 ——————————— 4 _ _ _ 5 6 4 × 5 = 20 2 2 1 _ _ 2 5 6 4 × 4 ——————————— 4 _ _ 2 5 6 4 × 2 = 8 1 2 2 1 _ 0 2 5 6 4 × 4 ——————————— 4 _ 0 2 5 6 4 × 0 = 0 1 2 2 1 1 0 2 5 6 4 × 4 ——————————— 4 1 0 2 5 6 4 × 1 = 4
So the minimum value is
See also
2017 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 | ||
All UNCO Math Contest Problems and Solutions |