Question of the Week - 27 (q is a three-digit number, in which ......)

reason for 766, 955 so as to get an integer value the sum of digits of series Q should add up to 10 , which upon subtraction from 10^99 would give a number divisible by 9

so in this case 766 ; 7+6+6=19= 1+9= 10 and 955; 9+5+5= 19=1+9=10

Hope this helps..

Srikantchamarthi

If someone cannot come up with the above mentioned approaches , you can simply start writing down the numbers which wont take long..
but firat you to understand that the 10^99 is just there to intimidate you....all you have to consider is 1000 because we are subtracting a three digit integer ..if we were subtracting two digit integer then we would have consider 100 ..
why so?? seewhen we subtract a small number from such a huge number the initial digits are going to be the same
for eg: 1000-100 = 900(initial number =9) 10000-100= 9900(initial num,bers 99) 100000-100= 99900(initial numbers =9)

so all we care about are the last three digits becasue those are the ones which are likely to be different from the rest of the initial numbers(in this case)...if we were subtracting a 4 digit number then we would only care for the last 4 digits of the bigger number becasue only those are likely to be different from other digits

for eg : 100000-100 = 99900 ... 100000-126= 99874 ... 100000-758 = 99242 (you can see that when you subtract 3 digit integer froma much larger number only the last three digits are likely to change)..you can do the same for subtraction of 4 digit number from a huge number

so the condition is : hundred digits( y) is greater than unit digit(x) ..and units and tens digit are same
therefore = 100y +10x+ x = 100y +11x

now we have to subtract the 3 digit number from 1000(assumed as explained above becasue every digit beyond the thousands digit to the left is going to be 9)
so write dwon all the digits first ; 0,1,2,3,4,5,6,7,8,9
remember the condition that : hundred digit is greater than units : y>x
we start with 0 - we want a three digit integer
start with hundered digit as 1 = 100 (only one number becasue then unit digit would be greater or equal to 1)
with 2: 200, 211
with 3
:300,311,322
similary till hundred digit as 9 : 900,911,922,933,....988

one more way to refine your search is as soon as you get a number subtract it from 1000 : for eg "100" ..ill get a 9 ad 0 ,0 at the end ...so yeah divisible by 9
consider 311 : ill get a 6+8+9 = 23 : not divisible ...as you proceed youll get a rouh idea even befr=ore you subtract...

i did in this way and solved it in 2.39 seconds...

thank you Archit3110

10^99/9 will have a remainder of 1, thus q must also have a remainder of 1.

x = hundreds digit
y = tens digit = units digit

x + 2y = 9t + 1

From here I had to test numbers:

t = 0, then xyy = 100
t = 1, then xyy = 811, 622, 433
t = 2, then xyy = 955, 766

Can be solved using remainder theorem -
10^99 - q should be divisible by 9

10^99 | 9 -> remainder 1

so q | 9 -> should be 1 or 10 or 19 or 28 in order to be divisible by 9 -------1

we know q = htu and h> u = t

lets add up all possible u & t numbers -> 00, 11, 22, ..., 88 (99 not possible)
place the digits for h and try to matchback with eqn 1, we will get 6 combinations.

took me 2 mins

Hoe it helps!

EgmatQuantExpert : my solution took me >2 mins.. please provide official solution


given relation Q=ABC
and A>C and B=C

Q=100A+10B+C
or say 100A+11B

we need to check \(10^{99} – q\) values of q we get integer

so as to get an integer value the sum of digits of series Q should add up to 10 , which upon subtraction from 10^99 would give a number divisible by 9

so from the list of three digit no following would be value of Q

100, 433,622,811 , 955, 766

IMO C is correct...

811
622
433
955
766
100

Archit3110 do you mind explaining it again especially 766, 955

The key to solving the question is getting the right numbers

by the constraint are that these has to be divisible by 9 after substraction from 10^99

The numbers that obey the criteria being
811
622
433
955
766
100

Hence IMO C

The sum of digits of 10^3 and 10^99 is same,so we can consider 10^3 instead of 10^99 to make finding a pattern easier.

Let x = \(10^{3} – q\).
x is divisible by 9.So q can be 991,982,973 etc.
Notice that the sum of digits of q , D[q] is of the form 9k + 1 ...........(1)

Testing with constraints:
1.q is 3 digit number
2.q is of the form abb.So D[q] = a + 2b
3.a>b
4.D[q] is of the form 9k + 1 ......from (1)

Largest value of q will be 988.
So max D[q] = 25 (9+8+8)
There are only 3 numbers of the form 9k+1 from 1 to 25.They are 1,10,19.
So a + 2b = 1 or a + 2b = 10 or a + 2b = 19

Testing values where a is 9 to 1
So 9 + 2b = 1 or 9 + 2b = 10 or 9 + 2b = 19
Only 9 + 2b = 19 will proved us with an integral value of b.
So first number is a =9,b=5
955

When a = 8.
So 8 + 2b = 1 or 8 + 2b = 10 or 8 + 2b = 19
Only 8 + 2b = 10 will proved us with an integral value of b.
So 2nd number is a =8 ,b=1

We can see a pattern here.When a is odd then a + 2b must also be odd in order to yield a non-negative integer.Likewise for even

7 + 2b = 19
766

6 + 2b = 10
622

5 + 2b = 19
577 -> Reject because a<b

4 + 2b = 10
433

3 + 2b = 19
388 -> Reject because a<b

2 + 2b = 10
244 -> Reject because a<b

With 1,there is only 1 possible number,100

Set is {955,811,766,622,433,100}

Option C i.e. total 6 those numbers.

As we know hundreds digit is greater than the units digit, and the units digit is equal to the tens digit. So If a number is divisible by 9 the sum of all digits of a number must also be divisible by 9. We know that 10^99 – q is divisible by 9. This means that -
10^99 not divisible by 9 as the sum of digits is divisible by 9, so if we put some value to q so that the resultant sum of digits will be divisible by 9. Then we can find the such total no of numbers that can be subtracted from 10^99 so that it can be divisible by 9, So -
eg- 10^99 - 1 = 99999999............99 (Total 99 zeros) will be divisible by 9
By using the above we can find the total such number.

Now such number must satisfy the condition of ''hundreds digit is greater than the units digit, and the units digit is equal to the tens digit''. This means that the sum must be 10 of all such number so that if we subtract that number with the 10^99, the resultant will be divisible by 9. So such number will be total 06 i.e. 100, 433, 622, 811,955, 766

So answer is option C

811 can't be an answer........the remainder after minus getting implemented will be 999....9299.The two in the answer won't let the sum be divisible by 9(Divisibility check - sum of digit is divisible by 9).

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.