It is currently 18 Nov 2017, 16:58

### GMAT Club Daily Prep

#### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# The three-digit positive integer n can be written as ABC

Author Message
Manager
Joined: 16 Feb 2010
Posts: 218

Kudos [?]: 378 [0], given: 16

The three-digit positive integer n can be written as ABC [#permalink]

### Show Tags

03 Jul 2010, 02:11
00:00

Difficulty:

(N/A)

Question Stats:

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

### HideShow timer Statistics

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?

(1) A + B/10 + C/100 = B + C/10 + A/100

(2) A + B/10 + C/100 = C + A/10 + B/100

OA:
[Reveal] Spoiler:
D

Kudos [?]: 378 [0], given: 16

Manager
Joined: 16 Feb 2010
Posts: 218

Kudos [?]: 378 [2], given: 16

Re: The Quest for 700: Weekly GMAT Challenge [#permalink]

### Show Tags

03 Jul 2010, 02:12
2
KUDOS
[Reveal] Spoiler:
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.

Kudos [?]: 378 [2], given: 16

Manager
Joined: 16 Feb 2010
Posts: 218

Kudos [?]: 378 [0], given: 16

Re: The Quest for 700: Weekly GMAT Challenge [#permalink]

### Show Tags

03 Jul 2010, 02:16
[Reveal] Spoiler:
(1) is simplified to 100A +10B+C = 100B+10C+A
therefore 99A=90B+C
11A=10B+C

thus 10 b + c gives 11 a ----> a,b,c similar numbers

if a,b,c are 111 therefore 37 has remainder 0....if 222, then remainder 0 again coz 222 is multiple of 111
same for 333,444 etc

(2) end up with similar equation thus similar answer

OA: D

Kudos [?]: 378 [0], given: 16

Manager
Joined: 04 Feb 2010
Posts: 196

Kudos [?]: 22 [0], given: 8

Re: The Quest for 700: Weekly GMAT Challenge [#permalink]

### Show Tags

03 Jul 2010, 07: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.

Kudos [?]: 22 [0], given: 8

Intern
Joined: 10 Jun 2010
Posts: 44

Kudos [?]: 50 [0], given: 2

Re: The Quest for 700: Weekly GMAT Challenge [#permalink]

### Show Tags

03 Jul 2010, 10: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.

Kudos [?]: 50 [0], given: 2

Manager
Joined: 06 Oct 2009
Posts: 68

Kudos [?]: 35 [0], given: 5

Re: The Quest for 700: Weekly GMAT Challenge [#permalink]

### Show Tags

09 Jul 2010, 21:54
zisis wrote:
[Reveal] Spoiler:
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.
_________________

+1 kudos me if this is of any help...

Kudos [?]: 35 [0], given: 5

Senior Manager
Joined: 25 Feb 2010
Posts: 448

Kudos [?]: 112 [0], given: 10

Re: The Quest for 700: Weekly GMAT Challenge [#permalink]

### Show Tags

10 Jul 2010, 12: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...

Kudos [?]: 112 [0], given: 10

Intern
Joined: 03 Mar 2010
Posts: 40

Kudos [?]: 22 [0], given: 1

Re: The Quest for 700: Weekly GMAT Challenge [#permalink]

### Show Tags

27 Jul 2010, 04: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.
_________________

Hardworkingly, you like my post, so kudos me.

Kudos [?]: 22 [0], given: 1

Re: The Quest for 700: Weekly GMAT Challenge   [#permalink] 27 Jul 2010, 04:16
Display posts from previous: Sort by