Last visit was: 20 Nov 2025, 04:57 It is currently 20 Nov 2025, 04:57
Close
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
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.
Close
Request Expert Reply
Confirm Cancel
User avatar
stonecold
Joined: 12 Aug 2015
Last visit: 09 Apr 2024
Posts: 2,244
Own Kudos:
3,550
 [7]
Given Kudos: 893
GRE 1: Q169 V154
GRE 1: Q169 V154
Posts: 2,244
Kudos: 3,550
 [7]
1
Kudos
Add Kudos
6
Bookmarks
Bookmark this Post
User avatar
Abhishek009
User avatar
Board of Directors
Joined: 11 Jun 2011
Last visit: 18 Jul 2025
Posts: 5,934
Own Kudos:
Given Kudos: 463
Status:QA & VA Forum Moderator
Location: India
GPA: 3.5
WE:Business Development (Commercial Banking)
Posts: 5,934
Kudos: 5,329
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
AkshdeepS
Joined: 13 Apr 2013
Last visit: 20 Nov 2025
Posts: 1,436
Own Kudos:
Given Kudos: 1,002
Status:It's near - I can see.
Location: India
Concentration: International Business, Operations
GPA: 3.01
WE:Engineering (Real Estate)
Products:
Posts: 1,436
Kudos: 1,884
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
35,359
 [2]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,359
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
stonecold
If m and n are positive integers such that m > n, what is the remainder when m² – n² is divided by 21?

(1) The remainder when (m + n) is divided by 21 is 1.
(2) The remainder when (m – n) is divided by 21 is 1.
Given: m and n are positive integers such that m > n

Target question: What is the remainder when m² – n² is divided by 21?

Statement 1: The remainder when (m + n) is divided by 21 is 1
There are several values of m and n that satisfy statement 1. Here are two:
Case a: m = 12 and n = 10. This means m + n = 12 + 10 = 22, and 22 divided by 21 leaves remainder 1. In this case, m² – n² = 12² – 10² = 144 - 100 = 44.
When we divide 44 by 21, we get 2 with remainder 2. So, the answer to the target question is when m² – n² is divided by 21, the remainder is 2
Case b: m = 13 and n = 9. This means m + n = 13 + 9 = 22, and 22 divided by 21 leaves remainder 1. In this case, m² – n² = 13² – 9² = 169 - 81 = 88.
When we divide 88 by 21, we get 4 with remainder 4. So, the answer to the target question is when m² – n² is divided by 21, the remainder is 4
Since we cannot answer the target question with certainty, statement 1 is NOT SUFFICIENT

Statement 2: The remainder when (m – n) is divided by 21 is 1
There are several values of m and n that satisfy statement 2. Here are two:
Case a: m = 5 and n = 4. This means m - n = 5 - 4 = 1, and 1 divided by 21 leaves remainder 1. In this case, m² – n² = 5² – 4² = 25 - 16 = 9.
When we divide 9 by 21, we get 0 with remainder 9. So, the answer to the target question is when m² – n² is divided by 21, the remainder is 9
Case b: m = 4 and n = 3. This means m - n = 4 - 3 = 1, and 1 divided by 21 leaves remainder 1. In this case, m² – n² = 4² – 3² = 16 - 9 = 7.
When we divide 7 by 21, we get 0 with remainder 7. So, the answer to the target question is when m² – n² is divided by 21, the remainder is 7
Since we cannot answer the target question with certainty, statement 2 is NOT SUFFICIENT

Statements 1 and 2 combined
Statement 1 tells us that the remainder is 1 when (m + n) is divided by 21
In other words, m+n is 1 greater than some multiple of 21.
So, we can write: m+n = 21k + 1 (for some integer k)

Statement 2 tells us that the remainder is 1 when (m - n) is divided by 21
In other words, m-n is 1 greater than some multiple of 21.
So, we can write: m-n = 21j + 1 (for some integer j)

Now recognize that we can factor m² – n²
We get: m² – n² = (m + n)(m - n)
= (21k + 1)(21j + 1)
= 21²mn + 21k + 21j + 1
= 21(21mn + k + j) + 1
Since 21(21mn + k + j) is definitely a multiple of 21, we can conclude that 21(21mn + k + j) + 1 is 1 greater than some multiple of 21.
In other words, m² – n² is 1 greater than some multiple of 21.
So, when m² – n² is divided by 21, the remainder is 1
Since we can answer the target question with certainty, the combined statements are SUFFICIENT

Answer: C

RELATED VIDEO FROM OUR COURSE
User avatar
fskilnik
Joined: 12 Oct 2010
Last visit: 03 Jan 2025
Posts: 885
Own Kudos:
Given Kudos: 57
Status:GMATH founder
Expert
Expert reply
Posts: 885
Kudos: 1,801
Kudos
Add Kudos
Bookmarks
Bookmark this Post
stonecold
If m and n are positive integers such that m > n, what is the remainder when m^2 – n^2 is divided by 21?

Statement 1: The remainder when (m + n) is divided by 21 is 1.

Statement 2: The remainder when (m – n) is divided by 21 is 1.
Important: the solution presented below assumes a reasonable quantitative maturity.
(If you do not have that, I recommend the excellent step-by-step presentation offered by Brent above.)


\(m > n \ge 1\,\,\,{\rm{ints}}\,\,\,\left( * \right)\)

\({m^{\rm{2}}} - {n^2} = 21K + R\)

\(K,R\,\,{\rm{ints}}\,\,,\,\,\,0 \le R \le 20\)

\(? = R\)


\(\left( 1 \right)\,\,m + n = 21J + 1\,\,,\,\,\,J\mathop \ge \limits^{\left( * \right)} 1\,\,\,{\mathop{\rm int}}\)

\(\left\{ \matrix{\\
\,{\rm{Take}}\,\,\left( {m,n} \right) = \left( {21,1} \right)\,\,\,\,\,\, \Rightarrow \,\,\,\,\,{m^{\rm{2}}} - {n^2} = {21^2} - {1^2}\,\,\, \Rightarrow \,\,\,\,R = \,\,20 \hfill \cr \\
\,{\rm{Take}}\,\,\left( {m,n} \right) = \left( {20,2} \right)\,\,\,\,\,\, \Rightarrow \,\,\,\,\,{m^{\rm{2}}} - {n^2} = {20^2} - {2^2} = \left( {20 - 2} \right)\left( {20 + 2} \right) = \left( {21 - 3} \right)\left( {21 + 1} \right) = 21\left( {21 + 1 - 3} \right) - 3\,\,\, \Rightarrow \,\,\,\,R = \,\,18\, \hfill \cr} \right.\)


\(\left( 2 \right)\,\,m - n = 21L + 1\,\,,\,\,\,L\mathop \ge \limits^{\left( * \right)} 0\,\,\,{\mathop{\rm int}} \,\)

\(\left\{ \matrix{\\
\,{\rm{Take}}\,\,\left( {m,n} \right) = \left( {2,1} \right)\,\,\,\,\,\, \Rightarrow \,\,\,\,\,{m^{\rm{2}}} - {n^2} = 3\,\,\, \Rightarrow \,\,\,\,R = \,\,3 \hfill \cr \\
\,{\rm{Take}}\,\,\left( {m,n} \right) = \left( {3,2} \right)\,\,\,\,\,\, \Rightarrow \,\,\,\,\,{m^{\rm{2}}} - {n^2} = 5\,\,\, \Rightarrow \,\,\,\,R = \,5\, \hfill \cr} \right.\)


\(\left( {1 + 2} \right)\,\,\,\,\left( {21J + 1} \right)\left( {21L + 1} \right) = 21\left( {21JL + J + L} \right) + 1\,\,\, \Rightarrow \,\,\,\,R = \,\,1\,\,\,\,\)


This solution follows the notations and rationale taught in the GMATH method.

Regards,
Fabio.
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,598
Own Kudos:
Posts: 38,598
Kudos: 1,079
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
Moderators:
Math Expert
105414 posts
496 posts