Find the smallest positive integer such that it ends with '2008' when written in base 10 and is divisible by 2007.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
How u found a value of c =173 ?
Log in to reply
Well, 1 7 2 × 1 0 0 0 0 < 1 7 2 0 8 5 6 , while 1 7 3 × 1 0 0 0 0 > 1 7 2 0 8 5 6 , which is what we need for a to be positive.
Let N be the desired integer. Since we need last four digits to be 2008, 2007 * N=#####4, since 4 * 8=42.
So 2007 * 4= 8028. To convert 2 in the tenth place to 0. we must add 80. (7 * 4=#8). This again comes from a 4. That is N=####44.
S0 2007 * 44= 88308. To convert 3 in the 10^2 th place to 0, we must add 700. (7 * 1=7). This again comes from a 1. That is N=###144
S0 2007 * 144= 289008. To convert 9 in the 10^3 th place to 2, we must add 3000. (7 * 9=#3). This again comes from a 9. That is N=###9144
S0 2007 * 9144= 18352008. We have done with smallest integer since we are approaching from digit with the smallest value.
The integer is
1
8
3
5
2
0
0
8
.
I set up the equation: 2007K=xx...x2008. I solved this problem by finding K and then multiplying by 2007. We know that the last digit of K has to be 4 because this is the only single digit number that when multiplied by 7 (the last digit of 2007) ends in 8 (the last digit of 2008). Then I multiplied 2000 and 4 (the already found last digit of K) to get 8000. 7K + 8000 must then have 2008 as its last four digits because the 2000 part of 2007 no longer contributes to the last four digits beyond its multiplication by the rightmost digit of K, 4. And so for in order for 2007K to end in 2008, 7K must end in 2008 - 8000 = 4008 (mod 10000). So, I first try to see if there exists an n such that 7K = 10000n + 4008, hopeful that 7K is a 5 digit number. If there does, then we are done (spoiler: there does). Since 10000/7 has a remainder of 4 and 4008/7 has a remainder of 4, then we must have 4n + 4 = 0 (mod 7). The smallest positive integer value of n for which this is achieved is n = 6. Therefore, 7K=64008 or K = 9144. Resulting in the final answer of 2017K = 18352008.
Problem Loading...
Note Loading...
Set Loading...
We want to find the smallest positive N such that N = 2 0 0 7 a = 1 0 0 0 0 b + 2 0 0 8 for integers a , b . Since 1 = 1 7 2 × 1 0 0 0 0 − 8 5 7 × 2 0 0 7 , we need to solve 2 0 0 7 a − 1 0 0 0 0 b 2 0 0 7 ( a + 2 0 0 8 × 8 5 7 ) = 2 0 0 8 ( 1 7 2 × 1 0 0 0 0 − 8 5 7 × 2 0 0 7 ) = 1 0 0 0 0 ( b + 2 0 0 8 × 1 7 2 ) and so (since 2 0 0 7 and 1 0 0 0 0 are coprime) we deduce that a = 1 0 0 0 0 c − 8 5 7 × 2 0 0 8 b = 2 0 0 7 c − 1 7 2 × 2 0 0 8 c ∈ N We need the smallest possible positive value of a = 1 0 0 0 0 c − 1 7 2 0 8 5 6 , and we do this by choosing c = 1 7 3 , obtaining a = 9 1 4 4 , and hence N = 2 0 0 7 a = 1 8 3 5 2 0 0 8 .