If p and n are positive integers

This topic has expert replies
Source: — Data Sufficiency |

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 16207
Joined: Mon Dec 08, 2008 6:26 pm
Location: Vancouver, BC
Thanked: 5254 times
Followed by:1268 members
GMAT Score:770

by Brent@GMATPrepNow » Sun Mar 09, 2014 7:27 am
kaudes11114 wrote:If p and n are positive integers and p > n, what is the remainder when p² - n² is divided by 15?
(1) The remainder when (p + n) is divided by 5 is 1.
(2) The remainder when (p - n) is divided by 3 is 1.
Target question: What is the remainder when p² - n² is divided by 15

NOTE that p² - n² is a difference of squares, so we can factor it to get: p² - n² = (p + n)(p - n). Since both (p + n) and (p - n) are in the statements, it may be useful to REPHRASE the target question...

Rephrased target question: What is the remainder when (p + n)(p - n) is divided by 15?

Statement 1: The remainder when (p + n) is divided by 5 is 1
This tell us that (p + n) is NOT DIVISIBLE by 5.
Since there's no information about (p-n), we can't determine the remainder when (p + n)(p - n) is divided by 15

Consider these two conflicting cases:
Case a: p = 5 and n = 1 (notice that the remainder when p+n is divided by 5 is 1). In this case, the remainder when is 9 when (p + n)(p - n) is divided by 15
Case b: p = 1 and n = 0 (notice that the remainder when p+n is divided by 5 is 1). In this case, the remainder when is 1 when (p + n)(p - n) is divided by 15
So, 2 of the numbers are less than 30
Since we cannot answer the target question with certainty, statement 1 is NOT SUFFICIENT

Statement 2: The remainder when p - n is divided by 3 is 1
Here we have no information about p+n.
Consider these two conflicting cases:
Case a: p = 5 and n = 1 (notice that the remainder when p-n is divided by 3 is 1). In this case, the remainder when is 9 when (p + n)(p - n) is divided by 15
Case b: p = 1 and n = 0 (notice that the remainder when p-n is divided by 3 is 1). In this case, the remainder when is 1 when (p + n)(p - n) is divided by 15
So, 2 of the numbers are less than 30
Since we cannot answer the target question with certainty, statement 2 is NOT SUFFICIENT

Statements 1 and 2 combined
IMPORTANT: Notice that I happened to use the same values for the counter-examples in each statement. This means that we can use the same values here to show that the COMBINED statements are not sufficient. That is...
Consider these two conflicting cases:
Case a: p = 5 and n = 1 (notice that both statements are satisfied). In this case, the remainder when is 9 when (p + n)(p - n) is divided by 15
Case b: p = 1 and n = 0 (notice that both statements are satisfied). In this case, the remainder when is 1 when (p + n)(p - n) is divided by 15
So, 2 of the numbers are less than 30
Since we cannot answer the target question with certainty, the COMBINED statements are NOT SUFFICIENT

Answer: E

ALTERNATIVELY, when examining the statements combined, we can use a nice rule that says:
If N divided by D, leaves remainder R, then the possible values of N are R, R+D, R+2D, R+3D,. . . etc.
For example, if k divided by 5 leaves a remainder of 1, then the possible values of k are: 1, 1+5, 1+(2)(5), 1+(3)(5), 1+(4)(5), . . . etc.

Okay, onto the question . . .
Statement 1: Applying the above rule, some possible values of p+n are 6, 11, 16, 21, 26, etc.
Aside: you'll notice that I didn't include 1 as a possible value since we're told that p and n are positive integers, and we can't get a sum of 1 if both are positive

Statement 2: Applying the above rule, some possible values of p-n are 1, 4, 7, 10, 13, etc

Let's examine two cases with conflicting results.

case a: p+n = 11 and p-n = 1
Add the equations to get 2p = 12, which means p = 6 and n = 5 (perfect, we have positive integer values for p and n)
In this case, when (p + n)(p - n) is divided by 15, the remainder is 11

case b: p+n = 6 and p-n = 4
Add the equations to get 2p = 10, which means p = 5 and n = 1 (perfect, we have positive integer values for p and n)
In this case, when (p + n)(p - n) is divided by 15, the remainder is 9
Since we cannot answer the target question with certainty, the combined statements are NOT SUFFICIENT

Answer = E

Cheers,
Brent
Brent Hanneson - Creator of GMATPrepNow.com
Image

User avatar
Legendary Member
Posts: 1556
Joined: Tue Aug 14, 2012 11:18 pm
Thanked: 448 times
Followed by:34 members
GMAT Score:650

by theCodeToGMAT » Sun Mar 09, 2014 7:36 am
To find: Remainder of (p^2 - n^2)/15

Statement 1:
(p+n)/5 leaves remainder 1
p+n can be 6,11,16,21,26,31, etc
No idea of p-n
INSUFFICIENT

Statement 2:
(p-n)/3 leaves remainder 1
p-n can be 1,4,7,10,13,16,19,22,25,28,31
No idea of p+n
INSUFFICIENT

Combining..
If (p+n) is 6 & (p-n) is 1, then remainder = 6
If (p+n) is 11 & (p-n) is 4, then remainder = 14
INSUFFICIENT

[spoiler]{E}[/spoiler]
R A H U L

GMAT Instructor
Posts: 2630
Joined: Wed Sep 12, 2012 3:32 pm
Location: East Bay all the way
Thanked: 625 times
Followed by:119 members
GMAT Score:780

by Matt@VeritasPrep » Sun Mar 09, 2014 12:48 pm
Brent's approach is great - let me add a couple of things that might come in handy on other problems.

One nice thing to know about remainders is that they are MULTIPLICATIVE, which means that you can find the remainder of x * y divided by k if you know the remainder of x divided by k and y divided by k. For instance, take 4, which has a remainder of 1 when divided by 3, and multiply it by 11, which we has a remainder of 2 when divided by 3. See how the remainders multiply to give the remainder of the product?

4 * 11 = 44

(rem 1) * (rem 2) = (rem 2)

Why is this happening? Well, consider 4 and 11 in terms of 3. 4 = (3+1) and 11 = (3*3 + 2), so when we multiply them, we get

(3+1) * (3*3 + 2) = 3*3*3 + 3*3 + 3 + 2

So the remainders determine the remainder! Too cool.

The key thing here, however, is that we're considering the remainder of each number relative to the SAME DIVISOR (3). In the GMAT problem you've given, however, we have DIFFERENT divisors: Statement I gives us the remainder relative to 5, while Statement II gives us the remainder relative to 3. This is a huge problem. Let's see why.

Statement 1 tells us that (p + n) is equal to some multiple of 5, plus 1. We can write that as (p + n) = 5k + 1, where k is some arbitrary multiplier that we don't know. (For instance, if p+n = 16 = 5*3 + 1, then k is 3. If p+n = 31 = 5*6 + 1, then k is 6. The value of k itself doesn't matter, it's just there to show that we have some unknown multiple of 5, plus 1.)

Statement 2 essentially gives us (p - n) = 3z + 1, where z, again, is some arbitrary multiple.

Taking the two together, we have (p + n) * (p - n) = (5k + 1) * (3z - 1) = 15kz + 3z - 5k - 1. We know that 15kz is divisible by 15, but what about 3z - 5k - 1? That's going to give us our remainder ... but we have NO IDEA what these numbers are. Hence the two statements together are insufficient.

Generally speaking, this approach helps on lots of number properties questions. Many students struggle with a statement like "x has a remainder of 3 when divided by 7", but all we have to do is write x = 7k + 3! Similarly, a statement as simple as "x is odd" can be written as x = 2k + 1. (Make sure you see why.) Once you start thinking of numbers this way, GMAT problems become much less abstract and intimidating.