BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

What is the remainder when 5-digit positive integer pqpqp is

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Source: — Data Sufficiency |

GMAT/MBA Expert

User avatar
Elite Legendary Member
Posts: 10392
Joined: Sun Jun 23, 2013 6:38 pm
Location: Palo Alto, CA
Thanked: 2867 times
Followed by:511 members
GMAT Score:800

by [email protected] » Tue May 02, 2017 3:58 pm
Hi ziyuenlau,

This DS question is built around a Number Property rule called "the rule of 3."

For a number to be divisible by 3 (meaning that the remainder would be 0), the sum of the digits of that number must total a number that is also divisible by 3.

For example, 18 is divisible by 3, since 1+8=9 and 9 is divisible by 3.
In that same way, 25 is NOT divisible by 3, since 2+5=7, and 7 is NOT divisible by 3.

We're told that we have a five-digit integer PQPQP. We're asked for the remainder when it is divided by 3.

1) P=2

With this Fact, we don't know the value of Q...

IF...
Q=0, then the number is 20202. 20202/3 = 6734 remainder 0
Q=1, then the number is 21212. 21212/3 = 7070 remainder 2
Fact 1 is INSUFFICIENT

2) Q=3

With this Fact, we don't know the value of P. However, we know that the digit "P" shows up 3 times, so the sum of the digits would be...

P3P3P --> 3P + 6

Regardless of the value of P, the sum of the digits would be a multiple of 3. Thus, P3P3P would always have a remainder of 0.
Fact 2 is SUFFICIENT

Final Answer: B

GMAT assassins aren't born, they're made,
Rich
Contact Rich at [email protected]
Image
Top

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 3008
Joined: Mon Aug 22, 2016 6:19 am
Location: Grand Central / New York
Thanked: 470 times
Followed by:34 members

by Jay@ManhattanReview » Wed May 03, 2017 10:54 pm
ziyuenlau wrote:What is the remainder when 5-digit positive integer pqpqp is divided by 3?

(1) p=2
(2) q=3

Source : Math Revolution
Statement 1: p = 2

This number is 2q2q2

For a number to be completely divisible by '3', the sum of its digits must be divisible by '3,' else we get a remainder.

Sum of digits = 2+q+2+q+ = 6 + 2q

We see that '6' is divisible by '3', and the remainder of '2q' divisible by '3' would depend on the value of 'q'. You may try any value for q from 0,1,2,...9. The remainders are not the same for the chosen digits. Insufficient.

Statement 2: q = 3

This number is p3p3p

Sum of digits = p+3+p+3+p = 6 + 3p = 3(2 + p).

Since 3(2 + p) is a factor of '3,' it is completely divisible by '3,' leaving a remainder '0.' The value of q does not affect the remainder. Sufficient.

The correct answer: B

Hope this helps!

Relevant book: Manhattan Review GMAT Math Essentials Guide

-Jay
_________________
Manhattan Review GMAT Prep

Locations: New York | Barcelona | Manila | Melbourne | and many more...

Schedule your free consultation with an experienced GMAT Prep Advisor! Click here.
Top
Post new topic Post Reply
• Page 1 of 1