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

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
Vote for Target Test Prep, Newsweek Readers’ Choice Awards 2026
NEWSWEEK READERS’ CHOICE 2026

BIG NEWS! Target Test Prep has been nominated, and they’d love your vote!

TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

Vote for TTP
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

GMAT Prep - p^2 - n^2 / 15

Expert replies
by jdawg » Tue Dec 09, 2008 12:05 am
Any tips on a "quick" way to solve this one...tried plugging in and got bogged down...

If p and n are positive integers and p > n, what is the remainder when p^2 - n^2 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.

E
Join the discussion
Source: — Data Sufficiency |

Re: GMAT Prep - p^2 - n^2 / 15

by parallel_chase » Tue Dec 09, 2008 2:52 am
jdawg wrote:Any tips on a "quick" way to solve this one...tried plugging in and got bogged down...

If p and n are positive integers and p > n, what is the remainder when p^2 - n^2 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.

E
p^2 - n^2 = (p+n)(p-n)

(p+n)(p-n) = 15k + r

Statement I

(p+n) = 5k + 1
we dont know if p-n can be divisible by 3 or not. Insufficient.

Similarly you can prove Statement II as insufficient.

Combining I & II
p>n
p+n = 5k + 1
p-n = 3x + 1

(5k+1)(3x+1) = 15k + r

15xk + 5k + 3x + 1 = 15k + r

15kx/15 + 5k/15 + 3x/15 + 1/15 = r

15kx/15 = remainder 0

5k/15 = k/3 = if k=0 remainder 0, if k=3 remainder 0, if k=2, remainder 2

3x/15 = x/5 = same as above

1/15 = remainder 1

Therefore answer E.

Here is another simpler way.

If you expand p^2 - n^2 into (p+n)(p-n) and look at both the statements you should get some idea that the answer could be either C or E.

At this time pluggin in numbers can be very useful. Also at this point you should try to get 2 remainders so as to prove the statement insufficient.

Hope this helps.
No rest for the Wicked....
Join the discussion

by cramya » Tue Dec 09, 2008 2:57 pm
Like PC said once u get to C) or E) u can pick number also.

Look at numbers that leave a remainder of 1 when divided by both 5 and 3

Eg: 6 can be expressed as (5+1)

p=5 n=1

p+n/5 remainder 1
p-n/3 remiander 1

(5+1) (5-1) / 15 remainder 9

Next number 11 p=6 n =5

p+n / 5 remainder 1
p-n / 3 remainder 1

(p+n) (p-n)

(6+5) (6-5)
11 * 1 / 15 reaminder 11

INSUFF

E)
Join the discussion

another way to look at it!

by manjithmanohar » Wed Apr 01, 2009 7:20 am
1 other approach or should I say an extension of the same logic..

the equation in the Q can be re-written as:

(p+n)/5 * (p-n)/3 = 1

using the statements the above can be re-written (again) as,

(5t+1) (3k+1) = 1

Where t and k are variable..
on simplifying:

15tk + 5t + 3k + 2 = 0
1 eq with 2 variable, can't solve..

That's my take.. correct me if I am wrong!
Join the discussion

by crackgmat007 » Sun Aug 02, 2009 11:03 am
Opening the thread again. Pls let me know if the below approach is correct.

Rephrase --> (p+n) (p-n) / 15 = remainder r?

1. gives info only about p+n -- insufficient
2. gives info only about p-n -- insufficient

1&2. (p+n) divided by 5 r is 1. Take 11 & for (p-n) take 7. Multiply and divide by 15 to find the remainder -> 2
Now take 16 & 4, remainder is 1. Hence E.

Is my approach correct or are there any logic flaws?
Join the discussion

by rperezgmat » Tue Mar 20, 2012 6:22 pm
Here is my solution, inspired by prior replies:

Prompt: (p+n) (p-n) = 15K + R, What is R? [Note: Keep in mind that K is irrelevant as it will be an integer).

(1) p+n = 5a + 1

Here a is an integer. I ask: What about p-n? I need to know how p-n will affect the expression in order to know what R is! INSUFFICIENT.

(2) p-n = 3b + 1

Here b is an integer. I apply the same logic as in Statement 1. INSUFFICIENT.

(1 & 2) I multiply both statements and get:

(p+n) (p-n) = (5a + 1) (3b + 1)

The question becomes... What is the remainder of (5a +1) (3b+1). Going to the prompt I know p>n, and that both p and n are positive. This tells me that (p+n)>(p-n).

This means 5a + 1 > 3b + 1, which means 5a > 3b. I pick numbers now:

If a=2, b could be 1
If a=2, b could be 2

I plug the values [a=2, b=1] and [a=2, b=2] back into the expression (5a+1) (3b+1).

The question now becomes:

What is the remainder of 11*4/15?
What is the remainder of 11*7/15?

44/15 and 77/15 yield different remainders.

Therefore, combining (1) and (2) is insufficient.

The correct answer is E.
GMAT Warrior
Join the discussion

by Whitney Garner » Fri Mar 23, 2012 1:35 pm
parallel_chase wrote:p^2 - n^2 = (p+n)(p-n)

(p+n)(p-n) = 15k + r

Statement I

(p+n) = 5k + 1
we dont know if p-n can be divisible by 3 or not. Insufficient.
Be VERY careful when you are using the formal definitions for things like remainder (15k+r), evens (2k), or odds (2k+1). You initially defined K as the quotient for the division of (p+n)(p-n) by 5. That is fine, but we cannot reuse that same value K when defining (p+n)/5 because we do not know that it will be the same integer.

I know it doesn't make a big different here, but we would need to establish a new variable for the stem, and then again for each statement!

Now for the problem itself:
jdawg wrote:If p and n are positive integers and p > n, what is the remainder when p^2 - n^2 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.

E
We can use the formal notation for remainder, but this could get ugly with the variables p & n running around with the 3 new variables I am going to have to create!

Maybe we can use some logic to at least eliminate the statements:

Statement 1:
- So I know that at least one part of my product is NOT divisible by 15 (it leaves a remainder 1 when divided by 5 so it cannot be divisible by a multiple of 5). But I have no clue about the other piece...it could be divisible, maybe not. So there is just no telling what the remainder would be!

Statement 2:
- Again I know that at least one part of my product is NOT divisible by 15 (it leaves a remainder 1 when divided by 3 so it cannot be divisible by a multiple of 3). But I have no clue about the other piece...it could be divisible, maybe not. So there is just no telling what the remainder would be!

Put the Statements together:
Let's try some numbers. What value can we use for (p+n) that has a remainder of 1 when divided by 5?
6, 11, 16, 21...

And what has a remainder of 1 when divided by 3?
4, 7, 10, 13...

Let's compare the lists and see if we can be extra careful and actually find workable values for p & n that make both expressions true! I could say 5+1=6 (R1 when divided by 5) and 5-1=4 (R1 when divided by 3), so those could be nice values for p and n. Plug them in and the product is 6*4=24, that leaves a remainder of 9 when divided by 15.

Can we do the same with 11 and 7? Yep, 9+2=11, 9-2=7. Their product is 77, leaving a remainder of 2 when divided by 15.

2 different answers means NOT Sufficient!
Whitney Garner
GMAT/GRE/EA Instructor & Anxiety/Accommodations Coach
www.whitneygarner.com

Contributor to Beat The GMAT!

Math is a lot like love - a simple idea that can easily get complicated :heart-eyes:
Join the discussion

by Brent@GMATPrepNow » Thu Oct 10, 2019 5:26 am
jdawg wrote:Any tips on a "quick" way to solve this one...tried plugging in and got bogged down...

If p and n are positive integers and p > n, what is the remainder when p^2 - n^2 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.

E
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
Join the discussion