Last visit was: 09 Jul 2025, 18:01 It is currently 09 Jul 2025, 18:01
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
AnkitK
Joined: 11 Feb 2011
Last visit: 01 Dec 2012
Posts: 86
Own Kudos:
1,278
 [81]
Given Kudos: 21
Posts: 86
Kudos: 1,278
 [81]
7
Kudos
Add Kudos
73
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 09 Jul 2025
Posts: 16,101
Own Kudos:
74,229
 [20]
Given Kudos: 475
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,101
Kudos: 74,229
 [20]
7
Kudos
Add Kudos
13
Bookmarks
Bookmark this Post
User avatar
sudhir18n
User avatar
Current Student
Joined: 26 May 2005
Last visit: 13 Feb 2013
Posts: 352
Own Kudos:
594
 [13]
Given Kudos: 13
Posts: 352
Kudos: 594
 [13]
11
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 13 May 2024
Posts: 6,756
Own Kudos:
34,043
 [9]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,756
Kudos: 34,043
 [9]
4
Kudos
Add Kudos
5
Bookmarks
Bookmark this Post
AnkitK
If n^m leaves a remainder of 1 after division by 7 for all positive integers n that are not multiples of 7, then m could be equal to :

(A) 2
(B) 3
(C) 4
(D) 5
(E) 6

The most important piece of information is here: "for all positive integers n that are not multiples of 7"

Since 2 is not a multiple of 7, then it must be the case that, for a particular value of m, 2^m leaves a remainder of 1 after division by 7

Let's check the answer choices....
(A) if m = 2, we get 2^2 = 4.
When we divide 4 by 7, we get a remainder of 4. We need a remainder of 1. ELIMINATE A

(B) if m = 3, we get 2^3 = 8.
When we divide 8 by 7, we get a remainder of 1. KEEP B

(C) if m = 4, we get 2^4 = 16.
When we divide 16 by 7, we get a remainder of 2. We need a remainder of 1. ELIMINATE C

(D) if m = 5, we get 2^5 = 32.
When we divide 32 by 7, we get a remainder of 4. We need a remainder of 1. ELIMINATE D

(E) if m = 6, we get 2^6 = 64.
When we divide 64 by 7, we get a remainder of 1. KEEP E

So, the correct answer is either B or E

Now try a different value of n.
How about n = 3
Check the remaining answer choices....

(B) if m = 3, we get 3^3 = 27.
When we divide 27 by 7, we get a remainder of 6. ELIMINATE B

Answer: E

RELATED VIDEO
General Discussion
User avatar
vyassaptarashi
Joined: 07 Oct 2010
Last visit: 20 Jan 2018
Posts: 102
Own Kudos:
Given Kudos: 10
Posts: 102
Kudos: 361
Kudos
Add Kudos
Bookmarks
Bookmark this Post
We need to find m for all positive integers.
Therefore, if we take a case of 2 then \(2^3\) and \(2^6\) will leave remainder of 1 after dividing by 7. we will restrict to 6 and not more than that because it is a largest value in the options and we have to select only one of them.

Then, i took a case of 3 ...In that 3^6 leaves remainder of 1 when divided by 7.

Now, we can conclude that the value of m will be 6 because it common value in both cases and one of the given option has to be correct. Hence m=6
thus E
User avatar
AnkitK
Joined: 11 Feb 2011
Last visit: 01 Dec 2012
Posts: 86
Own Kudos:
Given Kudos: 21
Posts: 86
Kudos: 1,278
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Nice explanation Sudhir.
User avatar
TGC
Joined: 03 Aug 2012
Last visit: 19 Jul 2017
Posts: 581
Own Kudos:
Given Kudos: 322
Concentration: General Management, General Management
GMAT 1: 630 Q47 V29
GMAT 2: 680 Q50 V32
GPA: 3.7
WE:Information Technology (Finance: Investment Banking)
GMAT 2: 680 Q50 V32
Posts: 581
Kudos: 3,489
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Somehow didn't get this question as per below.

n^m = 7Q + 1

n != 7A (where != is not equal to)

Consider n=6 and answer option (A) m=2

6^2 = 36 = 7*5 + 1

Why not (A) then?

Rgds,
TGC!
avatar
abhishekkhosla
Joined: 02 Jun 2013
Last visit: 03 Sep 2018
Posts: 15
Own Kudos:
121
 [2]
Given Kudos: 74
Posts: 15
Kudos: 121
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
hi everyone,

I solved this question like this , as 7 is a prime no and n can only take values which are not multiples of 7 so n and 7 will be co prime hence as per fermat little theorem value of m will be 7-1 = 6 for any value of n which are not multiples of n
User avatar
amanvermagmat
User avatar
Retired Moderator
Joined: 22 Aug 2013
Last visit: 28 Mar 2025
Posts: 1,161
Own Kudos:
Given Kudos: 480
Location: India
Posts: 1,161
Kudos: 2,741
Kudos
Add Kudos
Bookmarks
Bookmark this Post
abhishekkhosla
hi everyone,

I solved this question like this , as 7 is a prime no and n can only take values which are not multiples of 7 so n and 7 will be co prime hence as per fermat little theorem value of m will be 7-1 = 6 for any value of n which are not multiples of n

for those who know fermat little theorem(s) its good but for others, plugging in will always help as explained by Sudhir... thanks Abhishek though for reminding this theorem
User avatar
honchos
Joined: 17 Apr 2013
Last visit: 30 Aug 2021
Posts: 360
Own Kudos:
Given Kudos: 298
Status:Verbal Forum Moderator
Location: India
GMAT 1: 710 Q50 V36
GMAT 2: 750 Q51 V41
GMAT 3: 790 Q51 V49
GPA: 3.3
GMAT 3: 790 Q51 V49
Posts: 360
Kudos: 2,396
Kudos
Add Kudos
Bookmarks
Bookmark this Post
VeritasPrepKarishma
AnkitK
If n^m leaves a remainder of 1 after division by 7 for all positive integers n that are not multiples of 7, then m could be equal to :

(A) 2
(B) 3
(C) 4
(D) 5
(E) 6

Responding to a pm:

It is a conceptual question and it easy to figure out if you understand binomial theorem discussed here: https://www.gmatclub.com/forum/veritas-prep-resource-links-no-longer-available-399979.html#/2011/05 ... ek-in-you/

n^m leaves a remainder of 1 after division by 7 for all n (obviously n cannot be a multiple of 7 because that would leave a remainder of 0)
So n can be of the form (7a + 1) or (7a + 2) or (7a + 3) or (7a + 4) or (7a +5) or (7a + 6)

According to binomial, the remainder I will get when I divide n^m by 7 will depend on the last term i.e. 1^m or 2^m or 3^m or 4^m or 5^m or 6^m.
We need a value of m such that when we divide any one of these 6 terms by 7, we always get a remainder 1.

Can m be 2? 1^2 leaves remainder 1 but 2^2 leaves remainder 4. So no
Can m be 3? 1^3 leaves remainder 1, 2^3 leaves remainder 1. 3^3 leaves remainder 6. So no
Can m be 4? 1^4 leaves remainder 1 but 2^4 leaves remainder 2. So no
Can m be 5? 1^5 leaves remainder 1 but 2^5 leaves remainder 4. So no'

m must be 6 because that is the only option left.
1^6 leaves remainder 1, 2^6 leaves remainder 1 etc. So we see that we are correct.

I understand your solution, But how is it associated with Binomial theorem, we have solved it with plugin here?
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 09 Jul 2025
Posts: 16,101
Own Kudos:
74,229
 [1]
Given Kudos: 475
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,101
Kudos: 74,229
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
honchos
VeritasPrepKarishma
AnkitK
If n^m leaves a remainder of 1 after division by 7 for all positive integers n that are not multiples of 7, then m could be equal to :

(A) 2
(B) 3
(C) 4
(D) 5
(E) 6

Responding to a pm:

It is a conceptual question and it easy to figure out if you understand binomial theorem discussed here: https://www.gmatclub.com/forum/veritas-prep-resource-links-no-longer-available-399979.html#/2011/05 ... ek-in-you/

n^m leaves a remainder of 1 after division by 7 for all n (obviously n cannot be a multiple of 7 because that would leave a remainder of 0)
So n can be of the form (7a + 1) or (7a + 2) or (7a + 3) or (7a + 4) or (7a +5) or (7a + 6)

According to binomial, the remainder I will get when I divide n^m by 7 will depend on the last term i.e. 1^m or 2^m or 3^m or 4^m or 5^m or 6^m.
We need a value of m such that when we divide any one of these 6 terms by 7, we always get a remainder 1.

Can m be 2? 1^2 leaves remainder 1 but 2^2 leaves remainder 4. So no
Can m be 3? 1^3 leaves remainder 1, 2^3 leaves remainder 1. 3^3 leaves remainder 6. So no
Can m be 4? 1^4 leaves remainder 1 but 2^4 leaves remainder 2. So no
Can m be 5? 1^5 leaves remainder 1 but 2^5 leaves remainder 4. So no'

m must be 6 because that is the only option left.
1^6 leaves remainder 1, 2^6 leaves remainder 1 etc. So we see that we are correct.

I understand your solution, But how is it associated with Binomial theorem, we have solved it with plugin here?

The remainder you get when you divide (7a + 1)^m by 7 will be 1. The remainder you get when you divide (7a + 2)^m by 7 is determined by 2^m. This is determined by binomial theorem. The link explains you why.
User avatar
Beat720
Joined: 22 Dec 2014
Last visit: 12 Dec 2016
Posts: 26
Own Kudos:
Given Kudos: 182
Posts: 26
Kudos: 49
Kudos
Add Kudos
Bookmarks
Bookmark this Post
TGC
Somehow didn't get this question as per below.

n^m = 7Q + 1

n != 7A (where != is not equal to)

Consider n=6 and answer option (A) m=2

6^2 = 36 = 7*5 + 1

Why not (A) then?

Rgds,
TGC!

Can anyone please help to explain this issue! I have the same question!
Another case can be: n=2, m=3: 2^3 = 8 = 7*1 + 1 (n^m = 7*a + 1)
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 09 Jul 2025
Posts: 16,101
Own Kudos:
74,229
 [3]
Given Kudos: 475
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,101
Kudos: 74,229
 [3]
2
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Beat720
TGC
Somehow didn't get this question as per below.

n^m = 7Q + 1

n != 7A (where != is not equal to)

Consider n=6 and answer option (A) m=2

6^2 = 36 = 7*5 + 1

Why not (A) then?

Rgds,
TGC!

Can anyone please help to explain this issue! I have the same question!
Another case can be: n=2, m=3: 2^3 = 8 = 7*1 + 1 (n^m = 7*a + 1)

The question says that remainder should be 1 for all values of n. So n could be 1 or 2 or 3 or 4 etc, remainder when n^m is divided by 7 will ALWAYS be 1. Check for a few values of n.

In case m = 2,
1^2 = 1 - when 1 is divided by 7, remainder is 1 - fine
2^2 = 4 - when 4 is divided by 7, remainder is 4 - not acceptable

In case m = 3,
1^3 = 1 - when 1 is divided by 7, remainder is 1 - fine
2^3 = 8 - when 8 is divided by 7, remainder is 1 - fine
3^3 = 27 - when 27 is divided by 7, remainder is 6 - not acceptable

Only in case m = 6, for every value of n, you will get remainder 1.

Answer (E)

Another thing, if m = 2 or m = 3 were the answer, m = 6 would automatically be the answer too because

n^6 = (n^3)^2 = (n^2)^3

But in problem solving questions, you have only one correct answer.
avatar
abani
Joined: 20 Sep 2011
Last visit: 05 Jul 2025
Posts: 17
Own Kudos:
Given Kudos: 56
Concentration: Operations, International Business
GMAT 1: 640 Q40 V35
Products:
GMAT 1: 640 Q40 V35
Posts: 17
Kudos: 34
Kudos
Add Kudos
Bookmarks
Bookmark this Post
AnkitK
If n^m leaves a remainder of 1 after division by 7 for all positive integers n that are not multiples of 7, then m could be equal to :

(A) 2
(B) 3
(C) 4
(D) 5
(E) 6

n^m = 7x +1 ; numbers are 8,15,22,29,36,43,50,57,64,..

The squares we see are : 36 = 3^2x2^2 -> cannot be expressed as n^m
Next
64 =2^6 -> expressed in n^m
So 6 is answer. E.
User avatar
effatara
Joined: 09 Nov 2015
Last visit: 17 Jul 2024
Posts: 196
Own Kudos:
Given Kudos: 96
Posts: 196
Kudos: 424
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Option E satisfies the required condition (remainder is 1 when n^m is divided by 7) for all values of 'n' whereas option B satisfies it only when n=2 (remainder is 1 when 2^3 is divided by 7 but it is 6 when n=3: 3^3=27/7). Actually, the question itself is confusing. It should have stipulated: "m must be (instead of, could be) equal to:".
User avatar
JeffTargetTestPrep
User avatar
Target Test Prep Representative
Joined: 04 Mar 2011
Last visit: 05 Jan 2024
Posts: 2,996
Own Kudos:
Given Kudos: 1,646
Status:Head GMAT Instructor
Affiliations: Target Test Prep
Expert
Expert reply
Posts: 2,996
Kudos: 7,919
Kudos
Add Kudos
Bookmarks
Bookmark this Post
AnkitK
If n^m leaves a remainder of 1 after division by 7 for all positive integers n that are not multiples of 7, then m could be equal to :

(A) 2
(B) 3
(C) 4
(D) 5
(E) 6

Let’s test each answer choice.

A. m = 2

If n = 2, we see that 2^2/7 = 4/7 = 0 R 4, so m could not be 2.

B. m = 3

If n = 3, we see that 3^3/7 = 27/7 = 3 R 6, so m could not be 3.

C. m = 4

If n = 2, we see that 2^4/7 = 16/7 = 2 R 2, so m could not be 4.

D. m = 5

If n = 2, we see that 2^5/7 = 32/7 = 4 R 4, so m could not be 5.

At this point, we see that the correct choice must be E, but let’s verify that is case anyway.

E. m = 6

If n = 1, we see that 1^6/7 = 1/7 = 0 R 1.
If n = 2, we see that 2^6/7 = 64/7 = 9 R 1.
If n = 3, we see that 3^6/7 = 729/7 = 104 R 1.

We can stop at this point before the numbers get too large; we can see that E is the correct answer choice.

Answer: E
User avatar
Abhishek009
User avatar
Board of Directors
Joined: 11 Jun 2011
Last visit: 21 Apr 2025
Posts: 5,965
Own Kudos:
Given Kudos: 463
Status:QA & VA Forum Moderator
Location: India
GPA: 3.5
WE:Business Development (Commercial Banking)
Posts: 5,965
Kudos: 5,154
Kudos
Add Kudos
Bookmarks
Bookmark this Post
AnkitK
If n^m leaves a remainder of 1 after division by 7 for all positive integers n that are not multiples of 7, then m could be equal to :

(A) 2
(B) 3
(C) 4
(D) 5
(E) 6
Check using least values -

2^2 = 4 ( Will not give remainder 1 when divided by 7 - Eliminate option A )
3^3 = 27 ( Will not give remainder 1 when divided by 7 - Eliminate option B )
2^4 = 16 ( Will not give remainder 1 when divided by 7 - Eliminate option C )
2^5 = 32 ( Will not give remainder 1 when divided by 7 - Eliminate option D )

2^6 = 16 will give remainder 1 when divided by 7
3^6 = 729 2will give remainder 1 when divided by 7

The answer must be (E)
avatar
Funsho84
Joined: 08 Sep 2016
Last visit: 13 Aug 2022
Posts: 75
Own Kudos:
Given Kudos: 25
Posts: 75
Kudos: 63
Kudos
Add Kudos
Bookmarks
Bookmark this Post
The learning from this question is to test each case for a "could be " question. I stopped at B once I determined that 2^3 worked.
User avatar
hadimadi
Joined: 26 Oct 2021
Last visit: 03 Dec 2022
Posts: 114
Own Kudos:
Given Kudos: 94
Posts: 114
Kudos: 31
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hi,

we look for integer=m>0 such that n^m e {7a+1}, where a is a positive integer. This is because in this set, we have all the positive integers which leave remainder 1 when divided by 7. In general we know:

(x+y)^z=Mx+(y^z/x), where Mx denotes a multiple of x. To understand why, expand the binomial for any n, and you realize that any term contains an x, except the last one, which will be y^z. We further know that we look for z such that:

(x+y)^z=M7+1 -> (y^z/x)=1 for any x+y, where x and y are positive integers

Now, we have to find a way to depict all positive integers as x+y. If we do so smartly, we choose (7a+1), (7a+2),...,(7a+6). The union of these sets depicts all positive integers. All we are left to do is plug in m and see if (y^z)/7=M7+1
User avatar
BrushMyQuant
Joined: 05 Apr 2011
Last visit: 07 Jul 2025
Posts: 2,243
Own Kudos:
Given Kudos: 100
Status:Tutor - BrushMyQuant
Location: India
Concentration: Finance, Marketing
Schools: XLRI (A)
GMAT 1: 700 Q51 V31
GPA: 3
WE:Information Technology (Computer Software)
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Schools: XLRI (A)
GMAT 1: 700 Q51 V31
Posts: 2,243
Kudos: 2,457
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Given that n^m leaves a remainder of 1 after division by 7 for all positive integers n that are not multiples of 7 and we need to find m could be equal to

Let's take each option choice and check which one satisfies the statement

(A) 2
=> \(n^2\) gives 1 remainder when divided by 7 for all values of n which are not multiples of 7
Let's take n=2 we get
\(2^2\) = 4 divided by 7 gives 4 remainder ≠ 1 => NOT POSSIBLE

(B) 3
=> \(n^3\) gives 1 remainder when divided by 7 for all values of n which are not multiples of 7
Let's take n=2 we get
\(2^3\) = 8 divided by 7 gives 1 remainder
Let's take n=3 we get
\(3^3\) = 27 divided by 7 gives 6 remainder ≠ 1 => NOT POSSIBLE

(C) 4
=> \(n^4\) gives 1 remainder when divided by 7 for all values of n which are not multiples of 7
Let's take n=2 we get
\(2^4\) = 16 divided by 7 gives 2 remainder ≠ 1 => NOT POSSIBLE

(D) 5
=> \(n^5\) gives 1 remainder when divided by 7 for all values of n which are not multiples of 7
Let's take n=2 we get
\(2^5\) = 32 divided by 7 gives 4 remainder ≠ 1 => NOT POSSIBLE

(E) 6
So, Answer will be E but let's check for 1 number
=> \(n^6\) gives 1 remainder when divided by 7 for all values of n which are not multiples of 7
Let's take n=2 we get
\(2^6\) = 64 divided by 7 gives 1 remainder => POSSIBLE

So, Answer will be E
Hope it helps!

Watch the following video to learn the Basics of Remainders

 1   2   
Moderators:
Math Expert
102609 posts
PS Forum Moderator
683 posts