What is the smallest positive integer N such that the last three digits of 1 2 3 × N are 001?
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.
Nice calculations.
However, I would like to point out that when finding the minimum possible value of a b c , you want to minimize a then b then c , as opposed to the other way around. E.g. To find the smallest 3-digit number that is a multiple of 3, you'd want a = 1 , b = 0 , c = 2 . As opposed to saying c = 0 , b = 0 , a = 3 .
This doesn't affect your solution, because there is a unique value of c and b . Hence, instead of saying
c = 7 will be the least number possible to give us unit digit as 1.
it should instead be
c = 7 is the only possible value to give us unit digit as 1.
Likewise for the case of b , and the case of a is properly written.
Log in to reply
Oh yes sir! Thank you for pointing it out. Ill surely keep that in mind.
I used the same way and this is the easiest solution possible without the knowledge of mod values..
we had the same solution
Hah, I used a Python program because I was tired of guessing values on my calculator. (I knew that the last digit was 7 though, so calcing wasn't too hard)
hi I dont understand how u done this plz tell me simlest and clear way t solve this .. tthanxxx
Log in to reply
Basically, we are looking at the numbers that can be multiplied to 123 to produce the digits 001. For example, for the units digit, only 7 can be multiplied to 3 to obtain a number with a units digit of 1.
for me using modulo is hard hahaha
nice skills you have
1 2 3 N ≡ 1 ( m o d 1 0 0 0 ) . The multiplicative inverse of 123 mod 1000 is 187, so N ≡ 1 8 7 ( m o d 1 0 0 0 )
How did you deduce that 187 was the multiplicative inverse mod 1000 of 123?
Log in to reply
gcd(1000, 123) = 1, so we can apply the extended Euclidean algorithm: 1 0 0 0 − 1 2 3 ∗ 8 = 1 6 1 2 3 − 1 6 ∗ 7 = 1 1 1 6 − 1 1 ∗ 1 = 5 1 1 − 5 ∗ 2 = 1 Plugging back in backwards, we find that: 1 1 − ( 1 6 − 1 1 ∗ 1 ) ∗ 2 = 1 → 3 ∗ 1 1 − 2 ∗ 1 6 = 1 3 ∗ ( 1 2 3 − 1 6 ∗ 7 ) − 2 ∗ 1 6 = 1 → 3 ∗ 1 2 3 − 2 3 ∗ 1 6 = 1 3 ∗ 1 2 3 − 2 3 ∗ ( 1 0 0 0 − 1 2 3 ∗ 8 ) = 1 → 1 8 7 ∗ 1 2 3 − 2 3 ∗ 1 0 0 0 = 1 So 1 8 7 ∗ 1 2 3 ≡ 1 ( m o d 1 0 0 0 ) .
Log in to reply
Indeed, you should have mentioned in your solution that you used the technique of Euclidean Algorithm to find the multiplicative inverse. That will help others understand how you worked it out (instead of plucking the number magically from thin air).
explain how did u get that through multiplicative inverse
Log in to reply
There's an explanation in the comments, apologies for that. Unfortunately I don't know any good books on number systems, sorry.
can u tell me any good book for number systems plz
Assume N = a b c , where a is the hundred's digit, b is the ten's digit, and c is the one's digit.
We know that the ones digit has to be 1. The ones digit of the final product is the is the ones digit of the product of the ones digits of 123 and N.
So 3 N = f 1 , where f is a single digit number. The only number that works is 7, because 3 ∗ 7 = 2 1 .
The ten's digit is the sum of ( ( 2 ∗ 7 + 2 ) + 3 c So 1 6 + 3 c has to have a one's digit of zero. The only number that adds with 6 to get some number of zero is 4. So 3 c = d 4 , where d is another single digit number. 3*8=24, so the ten's digit is 8.
At this point it would be easiest to simply do guess and check, since we narrowed it down to 10 numbers.
1 2 3 ∗ 8 7 = 1 0 7 0 1
1 2 3 ∗ 1 8 7 = 2 3 0 0 1
187 gives us a product of 23001, so the answer is 8 7
The format of this solution doesn't recognized by the system.
answer = 187
00861 09840
23001
to get 1st digit "1" in 001 , 3 in 123 should be multiplied by 7
so 7 is units digit of N
units digit of 123 * 7 = 861 6 need 4 to be 0 in 001 so the next number is 8 as 8*3 = 24
just swim in space :(
Only 7 x 3 can get 1 as last digit. So N's last digit is 7. We get 7 x 123=861. To get 0 in 2nd last digit we must +4. The only way to get 4 as last digit is to multiply 3 by 8. now we get 10701. To get 0 as 3rd last digit we must +3. The only way is to multiply 3 by 1. Thus N is 187
Clearly, N must end in 7 . Therefore, N must be of the form ( 7 + x ) , where x is some positive number. 1 2 3 × N = 1 2 3 × ( 7 + x ) = 8 6 1 + 1 2 3 x . We observe, last three digits of 1 2 3 x must be 1 4 0 to get the last 3 digits of N as 0 0 1 . So, last 2 digits of x must be 8 0 . 1 2 3 × 8 0 = 9 8 4 0 ,which doesn't satisfy. So,when we try x = 1 8 0 ,which may the next possible number, we get last 3 digits as 1 4 0 , which we require.Therefore, N = 7 + 1 8 0 = 1 8 7 .
Sorry , forgot to mention that x must end in 0 in the 2 n d line.
nice one man!
See ..we go by the intuitive approach.. first step is to multiply with 7(as to get 1 in the last pos) then see which next number gives you a sum 0... continue till u get the last 3.. :)
Compile this code (Java) and look at the output. There are two methods you can use below, for those who are programmers and those who aren't.
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int x;
int y;
for (x=0;x<=999;x++){
y = 123 * x;
System.out.println(x + ". - " + y);
}
}
}
Copy the output put it in word and search for 001 or just insert a parse.int command and dissect 001 with the statement and insert a condition if the value of y contains 001 print the remaining, x.
If we want N * 123 ending with 1, then N has to be a number of the form 7 + 10x. So we have 123(7 + 10x) = 1230x + 861. Now, if we want 1230x + 861 ending with 01, then x has to be of the form 8 + 10k. So we get 1230(8 + 10k) + 861 = 12300k + 10701. If we want 12300k + 10701 ending with 001, then k has to be a number of the form 1 + 10r. But we are looking for the smaller value, so r = 0, k = 1, x = 18 and N = 7 + 10x = 187.
We know that 3*(last digit of N) has last digit of 1. The only number from 0-9 that satisfies this condition is 7. Therefore we know that the unit digit of N = 1.
Let the number be xy7 123*7 = 861
123
*xy7
8 6 1
y(2y)(3y)
(3x)
By the good old multiplication by hand method, last digit of (3 y+6) = 0 *(or (3 y+6)%10 = 0)* This implies that (3*y)%10 = 4, smallest y = 8. 6+24 = 30, bring over 3 to left side.
(3+8+2 y+3 x)%10 = 0 (3+8+16+3 x)%10 = 0 (27+3 x)%10 = 0 (3*x)%10 = 3 x = 1.
Thus, smallest N = 187
Problem Loading...
Note Loading...
Set Loading...
Let N be of the form a b c ( valid for 3 , 2 and one digit numbers )
Therefore the given condition can be written as : \ ? ? ? ? 0 0 1 0 0 a 0 b 2 a c 2 b 3 a 2 c 3 b X 3 c X X 0 × 1 a 2 b 3 c
We observe that :
c = 7 will be the least number possible to give us unit digit as 1 .
Now , carrying 2 to the tens place : [As 3 × 7 = 2 1 ] .
2 c + 3 b + 2 = 3 b + 1 6 → 0
Here ,
b = 8 will be the * least number possible * to give us tens digit as 0 .
Now ,
carrying 4 to the hundreds place : [As 3 × 8 + 1 6 = 4 0 ]
c + 2 b + 3 a + 4 = 3 a + 2 7 → 0
Here ,
a = 1 will be the * least number possible * to give us hundreds digit as 0
Hence. a b c = 1 8 7 .
Therefore , 1 8 7 is the required number .