Consider two positive integers a and b which are such that a a × b b is divisible by 2000.
What is the least possible value of the product a b ?
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.
Very good. I did this by taking 1 0 4 is the minimum power of 10 that is divisible by 2000. And got the answer 10
2 0 0 0 = 2 4 × 5 3 so at least one of a and b must contain a factor of 5 and the same goes goes for the factor of 2. ∴ 1 0 ∣ a b (10 is a factor of ab). ( a , b ) = ( 1 0 , 1 ) gives the required solution.
standard approach :)
If a = 1 0 and b = 1 then we get a solution of a b = 1 0 . There are only few pairs of natural numbers ( a , b ) such that their product is strictly less than 10 and they are ( 1 , 1 ) , ( 1 , 2 ) , … , ( 1 , 9 ) , ( 2 , 2 ) , ( 2 , 4 ) and ( 3 , 3 ) . Testing each of these shows that none of them satisfy 2 0 0 0 ∣ a a × b b so therefore the least possible value of a b is 1 0
To be divisible by 2000, a^a * b^b must be multiple of one 2 and three 10's . As the both numbers to multiplied are the form of a^a , from this we can easily conclude that 10 must be one of a or b. Then taking a=10 and b=1( as 10^10 contains multiple of one 2 and three 10's , hence selection of b is easy ), we can conlude.
Problem Loading...
Note Loading...
Set Loading...
To be divisible by 2000 a a b b must be the product of at least one 2 and at least three 10's. Then let b = 1 0 . It follows that a = 1 .