Last visit was: 22 Apr 2026, 02:44 It is currently 22 Apr 2026, 02:44
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
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 22 Apr 2026
Posts: 109,740
Own Kudos:
Given Kudos: 105,816
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,740
Kudos: 810,528
 [11]
Kudos
Add Kudos
11
Bookmarks
Bookmark this Post
User avatar
RaghavKhanna
Joined: 03 May 2020
Last visit: 23 Aug 2025
Posts: 264
Own Kudos:
312
 [3]
Given Kudos: 675
Location: India
Concentration: Marketing, Strategy
GMAT 1: 700 Q47 V39
GMAT 1: 700 Q47 V39
Posts: 264
Kudos: 312
 [3]
3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Kinshook
User avatar
Major Poster
Joined: 03 Jun 2019
Last visit: 21 Apr 2026
Posts: 5,986
Own Kudos:
5,855
 [2]
Given Kudos: 163
Location: India
GMAT 1: 690 Q50 V34
WE:Engineering (Transportation)
Products:
GMAT 1: 690 Q50 V34
Posts: 5,986
Kudos: 5,855
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
yashikaaggarwal
User avatar
Senior Moderator - Masters Forum
Joined: 19 Jan 2020
Last visit: 29 Mar 2026
Posts: 3,089
Own Kudos:
3,158
 [2]
Given Kudos: 1,510
Location: India
GPA: 4
WE:Analyst (Internet and New Media)
Posts: 3,089
Kudos: 3,158
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Using Euler theorem,

When A^x is divided by N, where A and N are co prime.
Since N here has only one factor other than 1
Ø(n) = n(1-1/n)
Ø(7) = 7(1-1/7)
Ø(7) = 6

So A^Ø(n) mod n = 1 as remainder
2^6 mod 7 = 1
(2^6)8 mod 7 * 2^3 mod 7
1*8 mod 7
8 mod 7
1 as remainder

Answer is A

Posted from my mobile device
User avatar
GMATinsight
User avatar
Major Poster
Joined: 08 Jul 2010
Last visit: 22 Apr 2026
Posts: 6,976
Own Kudos:
16,893
 [2]
Given Kudos: 128
Status:GMAT/GRE Tutor l Admission Consultant l On-Demand Course creator
Location: India
GMAT: QUANT+DI EXPERT
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
WE:Education (Education)
Products:
Expert
Expert reply
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
Posts: 6,976
Kudos: 16,893
 [2]
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
Bunuel
What is the remainder of 2^51 divided by 7?

A. 1
B. 2
C. 3
D. 4
E. 5

\(2^3\) Divided by 7 leaves remainder = 1

Taking 17 powers both sides

\((2^3)^{17}\) Divided by 7 leaves remainder = \(1^{17}\)

\((2)^{51}\) Divided by 7 leaves remainder = \(1\)

Answer: Option B

Please refer the following Video for the conceptual understanding

User avatar
Logo
User avatar
Current Student
Joined: 07 May 2020
Last visit: 07 May 2021
Posts: 55
Own Kudos:
26
 [3]
Given Kudos: 32
Location: United States
Schools: LBS '23 (A)
GRE 1: Q165 V159
GPA: 3.85
Products:
Schools: LBS '23 (A)
GRE 1: Q165 V159
Posts: 55
Kudos: 26
 [3]
3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Tell me if my method is wrong. I doubt it but it landed me on the correct answer.

2^1=2, 2^2=4, 2^3=8, 2^4=16. We've got cyclicity of 2, 4, 8, 6.

Count 7 times through the cyclicity of 2 and you land on 8.

8/7 leaves you with a remainder of 1.

Answer A.
avatar
Coxy4972
Joined: 05 Jun 2020
Last visit: 31 Jan 2022
Posts: 11
Own Kudos:
6
 [3]
Given Kudos: 11
Posts: 11
Kudos: 6
 [3]
3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Can anyone check my reasoning and confirm my calculations are accurate?

I used the cycles of 2 in exponents (2,4,8,6), and divided 51 by 4 to give 12r3. This indicates that we are in the third cycle, so we would be on 8 within the cycle. Therefore when divided by 7 the remainder would be 1.

Answer - A
User avatar
satya2029
Joined: 10 Dec 2017
Last visit: 29 Sep 2025
Posts: 229
Own Kudos:
Given Kudos: 138
Location: India
Posts: 229
Kudos: 254
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
What is the remainder of 2^51 divided by 7?

A. 1
B. 2
C. 3
D. 4
E. 5
\(2^3*2^(16)*3/(7)\)
1*1^(16)*3
=1
A:)
User avatar
GMATinsight
User avatar
Major Poster
Joined: 08 Jul 2010
Last visit: 22 Apr 2026
Posts: 6,976
Own Kudos:
Given Kudos: 128
Status:GMAT/GRE Tutor l Admission Consultant l On-Demand Course creator
Location: India
GMAT: QUANT+DI EXPERT
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
WE:Education (Education)
Products:
Expert
Expert reply
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
Posts: 6,976
Kudos: 16,893
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Coxy4972
Can anyone check my reasoning and confirm my calculations are accurate?

I used the cycles of 2 in exponents (2,4,8,6), and divided 51 by 4 to give 12r3. This indicates that we are in the third cycle, so we would be on 8 within the cycle. Therefore when divided by 7 the remainder would be 1.

Answer - A

Coxy4972

That's absolutely correct way. :thumbsup: :)
User avatar
IanStewart
User avatar
GMAT Tutor
Joined: 24 Jun 2008
Last visit: 17 Apr 2026
Posts: 4,143
Own Kudos:
11,268
 [2]
Given Kudos: 99
Expert
Expert reply
Posts: 4,143
Kudos: 11,268
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
LaurenGol
Tell me if my method is wrong. I doubt it but it landed me on the correct answer.

2^1=2, 2^2=4, 2^3=8, 2^4=16. We've got cyclicity of 2, 4, 8, 6.

Coxy4972
Can anyone check my reasoning and confirm my calculations are accurate?

I used the cycles of 2 in exponents (2,4,8,6), and divided 51 by 4 to give 12r3. This indicates that we are in the third cycle, so we would be on 8 within the cycle. Therefore when divided by 7 the remainder would be 1.

GMATinsight

That's absolutely correct way. :thumbsup: :)

No, it is not correct.

If you're looking at cyclic patterns in units digits, then you're answering the question "what remainder will I get if I divide by 10?" It's only when we divide a number by 10 that the units digit tells us the remainder.

We can also use units digits to quickly deduce remainders when we divide by 2 or by 5 (and units digits give us some information when we divide by related numbers like 20), but if you're dividing by a number unrelated to 2 and 5, units digits actually tell you nothing about what remainder you will get. So if you're dividing, say, by 3 or by 7 or by 9 or by 11, you actually don't learn anything useful by finding the units digit of your number, and if the units digit does give you the right answer, it's just pure coincidence.

You can see why that's true. In this question, it is correct that 2^51 has a units digit of 8. But if you look at numbers with a units digit of 8, you can see that you can have any remainder at all when you divide by 7. So 18 gives us a remainder of 4, 28 gives a remainder of 0, 38 gives a remainder of 3, and so on. Notice these numbers do not give a remainder of 1 when you divide by 7; we cannot simply divide the units digit by 7 to get the answer.

So while that method appears to give the right answer to this question, that just works out by luck, and the same method wouldn't work if the exponent in the problem were changed. The concept tested in this particular question is not one I've seen tested in any authentic GMAT question, so I wouldn't worry about it at all. It can be solved using remainder arithmetic (also called "modular arithmetic"), but that's not something the GMAT expects test takers to know. Essentially, since we get a remainder of 1 when we divide 2^3 by 7, we'll get a remainder of 1 when we divide any power of 2^3 by 7, including (2^3)^17 = 2^51.
User avatar
Shubham1213372
Joined: 07 Aug 2018
Last visit: 03 Dec 2021
Posts: 27
Own Kudos:
Given Kudos: 52
Posts: 27
Kudos: 8
Kudos
Add Kudos
Bookmarks
Bookmark this Post
2^51
Let's divide 51 by 4 and take the remainder as the final powerinstead of 51.
Because unit digit of 2 is repeated after every 2^4 term
Example
2^1=2
2^2=4
2^3=8
2^4=6
2^5=2
Similarly now onwards unit digit keeps on repeating.
Coming back to 51/4 , the remainder is 3.
Now our question becomes 2^3/7
2^3 =8.
Hence the remainder when 8/7 is 1.
Our answer is A

Posted from my mobile device
avatar
rcgard
Joined: 07 Aug 2019
Last visit: 09 Jul 2020
Posts: 9
Own Kudos:
5
 [1]
Given Kudos: 65
Posts: 9
Kudos: 5
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
What is the remainder of 2^51 divided by 7?

A. 1
B. 2
C. 3
D. 4
E. 5

Solution:
\(2^{51}=2^{(3)(17)}=8^{17}\)
\((7+1)^{17}\) -> \(1^{17}/7\) = remainder of 1

Answer choice A IMO
User avatar
AnirudhaS
User avatar
LBS Moderator
Joined: 30 Oct 2019
Last visit: 25 Jun 2024
Posts: 779
Own Kudos:
887
 [1]
Given Kudos: 1,575
Posts: 779
Kudos: 887
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Determining the cyclicity of the remainders (not the unit digits) - Please understand there is a difference in the two.

\(2^1 = 2\) So, \(2^1/7\) = remainder 2
\(2^2 = 4\) So, \(2^2/7\) = remainder 4
\(2^3 = 8\) So, \(2^3/7\) = remainder 1
\(2^4 = 16\) So, \(2^4/7\) = remainder 2
\(2^5 = 32\) So, \(2^5/7\) = remainder 4
\(2^6 = 64\) So, \(2^6/7\) = remainder 1

So we see the cyclicity of the remainders is 3 and in the order 2--> 4 --> 1
51/3 = 17 and leaves no remainder, so it is going to be the third remainder (2--> 4 --> 1)

Answer: A
User avatar
EgmatQuantExpert
User avatar
e-GMAT Representative
Joined: 04 Jan 2015
Last visit: 02 Apr 2024
Posts: 3,657
Own Kudos:
20,861
 [2]
Given Kudos: 165
Expert
Expert reply
Posts: 3,657
Kudos: 20,861
 [2]
Kudos
Add Kudos
Bookmarks
Bookmark this Post

Solution


To Find
    • Find the remainder when \(2^{51}\) is divided by 7.

Approach and Working Out

    • \(2^{51} \) can be manipulated as \((2^3)^{17}\).
      o We do that as \(2^3\) (i.e, 8) leaves a remainder of 1, when divided by 7.

    • \((2^3)^{17}\) divided by 7 will leave a remainder of
      = 1 × 1 × 1 … 17 times
      = 1
The answer is 1.


Correct Answer: Option A
User avatar
edison2020
Joined: 23 Oct 2018
Last visit: 11 Sep 2023
Posts: 73
Own Kudos:
Given Kudos: 84
Location: United States
GMAT 1: 600 Q45 V27 (Online)
GMAT 1: 600 Q45 V27 (Online)
Posts: 73
Kudos: 51
Kudos
Add Kudos
Bookmarks
Bookmark this Post
RaghavKhanna
2 and 7 are co - primes

=> R[2^6/7] = 1
=> R[2^51/7] = R[2^3/7] = 1

=> Answer: A

What are co primes?
N1/N2 — remainder is x and N2/N1 remainder is x ?

Posted from my mobile device
User avatar
ScottTargetTestPrep
User avatar
Target Test Prep Representative
Joined: 14 Oct 2015
Last visit: 21 Apr 2026
Posts: 22,276
Own Kudos:
26,528
 [1]
Given Kudos: 302
Status:Founder & CEO
Affiliations: Target Test Prep
Location: United States (CA)
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 22,276
Kudos: 26,528
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
What is the remainder of 2^51 divided by 7?

A. 1
B. 2
C. 3
D. 4
E. 5

Solution:

Notice that 2^51 = (2^3)^17 = 8^17. Since the remainder when 8 is divided by 7 is 1, the remainder when 8^17 is divided by 7 is 1^17 = 1.

Answer: A
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,957
Own Kudos:
Posts: 38,957
Kudos: 1,117
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Automated notice from GMAT Club BumpBot:

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

This post was generated automatically.
Moderators:
Math Expert
109740 posts
Tuck School Moderator
853 posts