Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

A positive integer is divisible by 9 if and only if the sum of its [#permalink]

Show Tags

14 Mar 2016, 12:34

5

This post received KUDOS

18

This post was BOOKMARKED

00:00

A

B

C

D

E

Difficulty:

35% (medium)

Question Stats:

77% (01:44) correct 23% (01:40) wrong based on 536 sessions

HideShow timer Statistics

A positive integer is divisible by 9 if and only if the sum of its digits is divisible by 9. If n is a positive integer, for which of the following values of k is \(25*10^n + k*10^2n\) divisible by 9?

Re: A positive integer is divisible by 9 if and only if the sum of its [#permalink]

Show Tags

14 Mar 2016, 14:06

7

This post received KUDOS

1

This post was BOOKMARKED

For any value of N, when you multiply by 10ˆn or 10ˆ2n you will be only adding zeros. What you only need to do is check if the sum of 2+5+the other possible values for k in the question add up to 9. The only possible answer is E.

Last edited by marcelonac on 15 Mar 2016, 12:11, edited 1 time in total.

Re: A positive integer is divisible by 9 if and only if the sum of its [#permalink]

Show Tags

15 Mar 2016, 07:29

marcelonac wrote:

For any value of N, the sum of the digits of 10ˆn and 10ˆ2n will always be 1. Since they're being multiplied by 25 and k, what you only need to do is check if the sum of 2+5+the other possible valued for k in the question add up to 9. The only possible answer is E.

Re: A positive integer is divisible by 9 if and only if the sum of its [#permalink]

Show Tags

15 Mar 2016, 23:55

4

This post received KUDOS

Excellent Question Here Taking out 10^n common => 100k+25 must be divisible by 9 checking values (try and start with last in such questions of plugging in values ) we get => E
_________________

Re: A positive integer is divisible by 9 if and only if the sum of its [#permalink]

Show Tags

27 Dec 2016, 06:50

Here is my approach:

It tells us that 25 × 10^n + k × 10^(2n) is divisible by 9 and we know that 10^whatever is not divisible by 9. So we just plug in numbers to find a number that satisfies that the sum of its digits (25 + k) is divisible by 9. Starting with option E: 25 + 47 = 72 and 7 + 2 = 9. Hence, when k=47 the number is divisible by 9.

Re: A positive integer is divisible by 9 if and only if the sum of its [#permalink]

Show Tags

03 Jan 2017, 11:54

2

This post was BOOKMARKED

bigdady wrote:

A positive integer is divisible by 9 if and only if the sum of its digits is divisible by 9. If n is a positive integer, for which of the following values of k is 25*10^n + k*10^2n divisible by 9?

(A) 9 (B) 16 (C) 23 (D) 35 (E) 47

25 = 7 (mod 9) = -2 (mod 9)

\(10^n = 10^{2n}\) = 1 (mod 9)

-2 * 1 + k*1 = k - 2

k should have remainder 2 when divided by 9 to give us total remainder 0.

Only option which leaves remainder 2 upon division by 9 is 47 (E).

Re: A positive integer is divisible by 9 if and only if the sum of its [#permalink]

Show Tags

27 Jan 2017, 05:18

1

This post received KUDOS

This looks like >620 imho

Solution:

25*10^n + k*10^2n = (25 * 10^n) + (k* 10^n * 10^n) {you should be able to see that 10^2n breaks into 10^n * 10^n else work your exponents roots in algebra}

then you can do 10^n * [ 25 +(k * 10^n) ] And here the logic/critical thinking begins

a) The only thing that the very first 10^n does to the number within the square brackets is simply padding it with zero at the end. (as other users suggested before). So it doesn't play any role to the divisibility hence can be fully ignored (N.B. n>0).

b) now 25 + (k * 10^n) simply is K * mul(10) + 25 therefore you care only about the sum of the digits K, 2 and 5. By using "back-solving" you can find E

Concentration: General Management, International Business

GMAT 1: 710 Q50 V35

GPA: 3.2

Re: A positive integer is divisible by 9 if and only if the sum of its [#permalink]

Show Tags

28 Jan 2017, 11:32

stonecold wrote:

Excellent Question Here Taking out 10^n common => 100k+25 must be divisible by 9 checking values (try and start with last in such questions of plugging in values ) we get => E

Re: A positive integer is divisible by 9 if and only if the sum of its [#permalink]

Show Tags

17 Feb 2017, 04:53

Korhand wrote:

stonecold wrote:

Excellent Question Here Taking out 10^n common => 100k+25 must be divisible by 9 checking values (try and start with last in such questions of plugging in values ) we get => E

nice explanation stonecold, thank you

I think the above way misses a crucial point.

Since n>0 then 10^n can be 10 and not 100 (i.e. n = 1 since n>0). Therefore the original relationship deduces to k * 10. So in order to be on the safe side I recommend to solve fro two values (more than two is an overkill imho)

A positive integer is divisible by 9 if and only if the sum of its digits is divisible by 9. If n is a positive integer, for which of the following values of k is 25*10^n + k*10^2n divisible by 9?

(A) 9 (B) 16 (C) 23 (D) 35 (E) 47

We need to determine for which value of k 25*10^n + k*10^2n is divisible by 9.

We see that 10^n and 10^2n will always have a digit of 1 and then zeros. So, excluding k, the sum of the digits in our expression is 2 + 5 = 7 (since (25)(10^n) has a 2, 5, and zeros).

We need to determine, of our answer choices, which when added to 7 will produce a sum that is divisible by 9. Scanning our answer choices, we see that 47 is the correct answer.

2 + 5 + 4 + 7 = 18, which is divisible by 9.

Answer: E
_________________

Scott Woodbury-Stewart Founder and CEO

GMAT Quant Self-Study Course 500+ lessons 3000+ practice problems 800+ HD solutions

We see that 10^n and 10^2n will always have a digit of 1 and then zeros. So, excluding k, the sum of the digits in our expression is 2 + 5 = 7 (since (25)(10^n) has a 2, 5, and zeros).

Why do we not add for 10^x here and only consider 2 + 5 = 7
_________________

It's the journey that brings us happiness not the destination.

We see that 10^n and 10^2n will always have a digit of 1 and then zeros. So, excluding k, the sum of the digits in our expression is 2 + 5 = 7 (since (25)(10^n) has a 2, 5, and zeros).

Why do we not add for 10^x here and only consider 2 + 5 = 7

Try to see it this way: 25*10 = 250 (sum of digits = 2+5); similarly 25*10^6 = 25000000 (sum of the digits = 2+5) etc. So in all cases, the sum of the digits for 25*(10^n) will always be 2+5 = 7.

Hope this helps.

P.S. the easiest/most straightforward way for this would have been to assume n=1 and then play with smaller numbers.