Data Sufficiency

The answer would be B)

Stmt I

8*10^k+j divided by m

k=13

8*10^k would be 8 followed by k zeros with sum of the digits = 8

Depending on the value of j the remainder changes

j=1 remainder 0
j=2 remainder 1

etc...

INSUFF

Stmt II

j=1

Exactly what we need remiander will always be 0

SUFF

Choose B)

Regards,
Cramya

Also if possible please post DS questions in the DataSufficiency section of the forum

Brent Hanneson wrote:The OA is B and I'll post these questions in the DS section from now on.
Cheers,
Brent

I warned you about Cramya!!! Watch out!

8*10^k would be 8 followed by k zeros with sum of the digits = 8

Depending on the value of j the remainder changes

j=1 remainder 0
j=2 remainder 1


hmm .. i don't get it .. u mentioned "8*10^k would be 8 followed by k zeros" ... that i get ... but why do i care about the "sum of the digits = 8?"
and what about the nine mentioned in the question?

You can also see that 8 x 10^k will always have a remainder of 8 when divided by 9.
That is, 8 x 10^1 = 80, which has a remainder of 8 when divided by 9.
8 x 10^2 = 800 which also has a remainder of 8 when divided by 9.
. . . etc.
Therefore, the only variable we need to concern ourselves with is what j is.

Rule of divisibility by 9:
If the sum of the digits of the number is divisible by 9, so is the number itself.

Stat 1:
8*10^13+j.Depending upon the value of J,sum of the digits can change.
So,Insufficient.

Stat 2:
8*10^K+1.Sum of digits is 9.
9/9.
So,the number is divisible by 9.
So,Sufficient.

Ans:B

for a given value of k, the remainder would be different for different 'j'. So it is not sufficient to know the value of k
however if j = 1 then you always get a number whose digit-sum = 9, hence predictable / constant remainder.
Hence (B)

Brent Hanneson wrote:Source: Beat The GMAT Practice Questions

If j and k are positive integers, what is the remainder when 8 * 10^k + j is divided by 9?
(1) k = 13
(2) j = 1

Indeed a cool question ,

We know any number is divisible by 9 , if and only if the sum of the digits of the number is divisible by 9.

Now it is given :

8 * 10^k + j

k can take any value from 0 to infinity but the numeric value will remain the same which is 8 in this case.

Numberic value/Digital Sum = Sum of all the digits of a number .

Say

If k = 0 we get 8 (Digital Sum is 8)

If k = 2 we get 800 (Digital Sum 8)

If k = 4 we get 80000 (Digital Sum 8)


Thus this part has the same digital sum which is 8.


Hence we can't get anything from this statement.

From statement 2

We get j = 1

Now the digital sum of 8 * 10^k + j will come as 9 ; irrespective of any value of k ( As we have seen).

Thus statement 2 helps us to find the answer.

Brent Hanneson wrote:Source: Beat The GMAT Practice Questions

If j and k are positive integers, what is the remainder when 8 * 10^k + j is divided by 9?
(1) k = 13
(2) j = 1

in the beginning i thought u meant to say 8*10^(k+j) but once i got that cleared the problem is pretty simple as mentioned in the explanations mentioned above IMO B

Brent

What level DS question would this be - I am thinking that this will be in the medium / medium easy range (600 - 650? or lower?)

What do you think?

thanks
Jd

Fantastic questions..totally squeezed my tiny brains by trying to apply the concepts! But....

...why the options are not mentioned....A, B, C, D, E?

The answer will be B.

This can be solved by basic division rule.

8*10^k , if we add the digits of the number formed by this than we will get 8(because the number will be in the form of
8 for k=0
80 for k=1
800 for k=2
8000 for k=3

Now if we add 1 to this we will get the sum of digits of that number as 9. The number thus formed will be like
9 for k=0 & j=1
81 for k=1 & j=1
801 for k=2 & j=1
8001 for k=3 & j=1

Any number is divisible by 9 if the sum of it's digit is directly divisible by 9.

So we see the value of k doesn't matter while deciding the divisibility of this number.

Hence only B is required.

Hope this explains the question well.

A fairly simple one though(compared to the previous question I use to get in my emails)