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.

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:

The three-digit positive integer n can be written as ABC [#permalink]
03 Jul 2010, 01:11

00:00

A

B

C

D

E

Difficulty:

5% (low)

Question Stats:

33% (01:26) correct
67% (01:57) wrong based on 21 sessions

not sure if anyone is posting this questions from the mbamission.com quest....

The three-digit positive integer n can be written as ABC, in which A, B, and C stand for the unknown digits of n. What is the remainder when n is divided by 37?

The question stem tells us that the positive integer n has three unknown digits: A, B, and C, in that order. In other words, n can be written as ABC. Note that in this context, ABC does not represent the product of the variables A, B, and C, but rather a three-digit integer with unknown digit values. It is important to note that since A, B, and C stand for digits, their values are restricted to the ten digits 0 through 9. Moreover, A cannot equal 0, since we know that n is a “three-digit” integer and therefore must be at least 100.

We are asked for the remainder after n is divided by 37. We could rephrase this question in a variety of ways, but none of them are particularly better than simply leaving the question as is.

Statement (1): SUFFICIENT. We can translate this statement to a decimal representation, which will be easier to understand. The left side of the equation, in words, is “A units plus B tenths plus C hundredths.” We can write this in shorthand: A.BC (that is, “A point BC”). After performing the same translation to the right side of the equation, we can see that we get the following:

A.BC = B.CA

Since A, B, and C stand for digits, we can match up the decimal representations and observe that A = B and B = C. Thus, all the digits are the same.

This means that we can write n as AAA, which is simply 111 × A.

Now, 111 factors into 3 × 37, so n = 3 × 37 × A. Thus, n is a multiple of 37, and the remainder after division by 37 is zero.

Statement (2): SUFFICIENT. Again, we can match up the decimal representations of the given equation and find that all the digits are the same. The logic from that point forward is identical to that shown above.

The correct answer is (D): EACH statement ALONE is sufficient.

Re: The Quest for 700: Weekly GMAT Challenge [#permalink]
03 Jul 2010, 06:23

Both statements indicate that the three digits are the same. Factor 111 into 37 and 3 - remainder is 0 - any other numbers with all the same digits are multiples of 37. Therefore D. Intimidating phrasing but a fun problem in the end.

Re: The Quest for 700: Weekly GMAT Challenge [#permalink]
03 Jul 2010, 09:09

Great question! I chose E initially as there were multiple numbers (111,222,333 etc) for which condition 1 and two hold good. However when u divide each of these by 37, you realize that the remainder is always Zero. Hence D is right.

The question stem tells us that the positive integer n has three unknown digits: A, B, and C, in that order. In other words, n can be written as ABC. Note that in this context, ABC does not represent the product of the variables A, B, and C, but rather a three-digit integer with unknown digit values. It is important to note that since A, B, and C stand for digits, their values are restricted to the ten digits 0 through 9. Moreover, A cannot equal 0, since we know that n is a “three-digit” integer and therefore must be at least 100.

We are asked for the remainder after n is divided by 37. We could rephrase this question in a variety of ways, but none of them are particularly better than simply leaving the question as is.

Statement (1): SUFFICIENT. We can translate this statement to a decimal representation, which will be easier to understand. The left side of the equation, in words, is “A units plus B tenths plus C hundredths.” We can write this in shorthand: A.BC (that is, “A point BC”). After performing the same translation to the right side of the equation, we can see that we get the following:

A.BC = B.CA

Since A, B, and C stand for digits, we can match up the decimal representations and observe that A = B and B = C. Thus, all the digits are the same.

This means that we can write n as AAA, which is simply 111 × A.

Now, 111 factors into 3 × 37, so n = 3 × 37 × A. Thus, n is a multiple of 37, and the remainder after division by 37 is zero.

Statement (2): SUFFICIENT. Again, we can match up the decimal representations of the given equation and find that all the digits are the same. The logic from that point forward is identical to that shown above.

The correct answer is (D): EACH statement ALONE is sufficient.

zisis, great explanation. Kudos to you. _________________

Re: The Quest for 700: Weekly GMAT Challenge [#permalink]
10 Jul 2010, 11:51

zisis wrote:

The question stem tells us that the positive integer n has three unknown digits: A, B, and C, in that order. In other words, n can be written as ABC. Note that in this context, ABC does not represent the product of the variables A, B, and C, but rather a three-digit integer with unknown digit values. It is important to note that since A, B, and C stand for digits, their values are restricted to the ten digits 0 through 9. Moreover, A cannot equal 0, since we know that n is a “three-digit” integer and therefore must be at least 100.

We are asked for the remainder after n is divided by 37. We could rephrase this question in a variety of ways, but none of them are particularly better than simply leaving the question as is.

Statement (1): SUFFICIENT. We can translate this statement to a decimal representation, which will be easier to understand. The left side of the equation, in words, is “A units plus B tenths plus C hundredths.” We can write this in shorthand: A.BC (that is, “A point BC”). After performing the same translation to the right side of the equation, we can see that we get the following:

A.BC = B.CA

Since A, B, and C stand for digits, we can match up the decimal representations and observe that A = B and B = C. Thus, all the digits are the same.

This means that we can write n as AAA, which is simply 111 × A.

Now, 111 factors into 3 × 37, so n = 3 × 37 × A. Thus, n is a multiple of 37, and the remainder after division by 37 is zero.

Statement (2): SUFFICIENT. Again, we can match up the decimal representations of the given equation and find that all the digits are the same. The logic from that point forward is identical to that shown above.

The correct answer is (D): EACH statement ALONE is sufficient.

+1 It took me more then 3 minutes to solve this... Nice explanation.. _________________

GGG (Gym / GMAT / Girl) -- Be Serious

Its your duty to post OA afterwards; some one must be waiting for that...

Re: The Quest for 700: Weekly GMAT Challenge [#permalink]
27 Jul 2010, 03:16

Interesting question, it help me recalling early years at secondary school. OK, let me solve it as follows: Firstly, to be clear about notation, when I write ABC, it means a 3-digit integer, such as 235, 536, and so on. It is remarked that: ABC=100*A+10*B+C=100*(A+B/10+C/100)

Statement 1 is equevalent to ABC=BCA, therefore A=B=C, or ABC=111, 222, ..., 999 The same for statement 2.

On the other hand, 111, 222, ..., 999 are multiples of 37. Therefore correct answer is D. _________________

Hardworkingly, you like my post, so kudos me.

gmatclubot

Re: The Quest for 700: Weekly GMAT Challenge
[#permalink]
27 Jul 2010, 03:16