Each of the letters a to j represents a unique integer from 1 to 9. Which of these numbers is divisible by 1001?
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.
Let's start with this.
We don't know which letter represents which digit
We have to make a 6-digit number.
Now, let number be uvwxyz(it's not multiplication) where u, v, w, x, y and z represent digits.
It can be written as
1 0 5 u + 1 0 4 v + 1 0 3 w + 1 0 2 x + 1 0 y + z
= ( 1 0 5 u + 1 0 2 x ) + ( 1 0 4 v + 1 0 y ) + ( 1 0 3 w + z )
Now, if (u, x), (v, y) and (w, z) are equal, we get a number divisible by 1001 as above number can be written as
( 1 0 0 1 0 0 u ) + ( 1 0 0 1 0 v ) + ( 1 0 0 1 w ) = uvwuvw (again not multiplication)
Now, 4 t h option corresponds to this value.
For a number to be divisible by 1 1 , the sums of the alternate digits (e. g. the first, third, fifth,... digits and the second, fourth, sixth... digits) must be equal or differ by multiples of 1 1 . Of the given options, only the fourth satisfy this condition.
Problem Loading...
Note Loading...
Set Loading...
b d c b d c = 1 0 0 0 0 0 b + 1 0 0 0 0 d + 1 0 0 0 c + 1 0 0 b + 1 0 d + c = 1 0 0 1 0 0 b + 1 0 0 1 0 d + 1 0 0 1 c = 1 0 0 1 ( 1 0 0 b ) + 1 0 0 1 ( 1 0 d ) + 1 0 0 1 ( c ) = 1 0 0 1 ⋅ ( 1 0 0 b + 1 0 d + c )