Pattern spotting

Each of the letters a a to j j represents a unique integer from 1 to 9. Which of these numbers is divisible by 1001?

adc bcd adj jdd fid iid bdc bdc

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.

3 solutions

Mahdi Raza
May 31, 2020

b d c b d c = 100000 b + 10000 d + 1000 c + 100 b + 10 d + c = 100100 b + 10010 d + 1001 c = 1001 ( 100 b ) + 1001 ( 10 d ) + 1001 ( c ) = 1001 ( 100 b + 10 d + c ) \begin{aligned} \overline{bdc bdc} &= 100000b + 10000d + 1000c + 100b + 10d + c \\ \\ &= 100100b + 10010d + 1001c \\ \\ &= 1001(100b) + 1001(10d) + 1001(c) \\ \\ &= {\color{#D61F06}{1001}}\cdot(100b + 10d + c) \end{aligned}

Aryan Sanghi
May 30, 2020

Let's start with this.

  1. We don't know which letter represents which digit

  2. 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 + 10 y + z 10^5u + 10^4v + 10^3w + 10^2x + 10y + z

= ( 1 0 5 u + 1 0 2 x ) + ( 1 0 4 v + 10 y ) + ( 1 0 3 w + z ) (10^5u + 10^2x) + (10^4v + 10y) + (10^3w + 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

( 100100 u ) + ( 10010 v ) + ( 1001 w ) (100100u) + (10010v) + (1001w) = uvwuvw (again not multiplication)

Now, 4 t h 4^{th} option corresponds to this value.

For a number to be divisible by 11 11 , 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 11 11 . Of the given options, only the fourth satisfy this condition.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...