Last visit was: 25 Apr 2024, 15:43 It is currently 25 Apr 2024, 15:43

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
SORT BY:
Date
Tags:
Show Tags
Hide Tags
Quant Chat Moderator
Joined: 22 Dec 2016
Posts: 3089
Own Kudos [?]: 4104 [0]
Given Kudos: 1851
Location: India
Concentration: Strategy, Leadership
Send PM
Tutor
Joined: 16 Oct 2010
Posts: 14823
Own Kudos [?]: 64923 [1]
Given Kudos: 426
Location: Pune, India
Send PM
Director
Director
Joined: 16 Jun 2021
Posts: 994
Own Kudos [?]: 183 [1]
Given Kudos: 309
Send PM
Intern
Intern
Joined: 18 Mar 2021
Posts: 16
Own Kudos [?]: 1 [0]
Given Kudos: 1
Send PM
Re: What is the remainder when 2^99 is divided by 99? [#permalink]
can someone please help with a easier explanation of the solution to this question..
Intern
Intern
Joined: 19 Dec 2018
Posts: 16
Own Kudos [?]: 2 [1]
Given Kudos: 13
Send PM
What is the remainder when 2^99 is divided by 99? [#permalink]
1
Kudos
Re(2^99 /99)
99=9*11 ; 9 and 11 are co prime

Separately find out remainders with 9 and 11 as the divisor.

Re (2^99 /9)
2^3 i.e. 8 mod 9 gives -1 as the remainder
Re [2^3)^33 /9]=-1=8

Now,

Re (2^99 /11)
Since 2 and 11 are co prime, Euler Method can be easily applied.
E(11)=10
Re (2^99 /11)= ?

Had the power been 100 we would had got 1 as the remainder.
Re[(2^99) * 2 /11]=1
2 mod 11 =2
2^100 mod 11 =1
So,
(2^99) * (2) mod 11 =1
(..) * 2 =1
If we put 6 in place of (..) we would get 12
Now 12 mod 11=1 (This is kind of reverse Euler).
Concluding
2^99 mod 9= 8,17,26,35,43......
2^99 mod 11=6,17,23,.....

Converging no is 17 which is the remainder.
Intern
Intern
Joined: 15 Feb 2023
Posts: 16
Own Kudos [?]: 10 [0]
Given Kudos: 49
Concentration: Operations, Sustainability
GMAT 1: 700 Q49 V37
Send PM
Re: What is the remainder when 2^99 is divided by 99? [#permalink]
mandeepkathuria wrote:
Bunuel wrote:
What is the remainder when \(2^{99}\) is divided by 99?

A. 17
B. 15
C. 13
D. 11
E. 9




since 99 can be written as 3*3*11, and none of the three prime factors can be cancelled with the numerator. we simply add the three primes. (3+3+11 = 17)
answer - A) 17


What are you talking bro? You mean to say every number which doesnt have 3 and 11 as its factors, will leave a remainder of 17 when divided by 99... hilarious way to reach an answer :) :lol:
Tutor
Joined: 26 Jun 2014
Status:Mentor & Coach | GMAT Q51 | CAT 99.98
Posts: 452
Own Kudos [?]: 759 [0]
Given Kudos: 8
Send PM
Re: What is the remainder when 2^99 is divided by 99? [#permalink]
Expert Reply
Bunuel wrote:
What is the remainder when \(2^{99}\) is divided by 99?
A. 17
B. 15
C. 13
D. 11
E. 9
Are You Up For the Challenge: 700 Level Questions: 700 Level Questions


2^99 ÷ 99
= (2^9)^11 ÷ 99
= 512^11 ÷ 99
= 17^11 ÷ 99
= [(17^2)^5 * 17] ÷ 99
= [289^5 * 17] ÷ 99

289 ÷ 99 leaves remainder -8
Thus, we have (each stage representing equivalent expressions in terms of the remainders):
[(-8)^5 * 17] ÷ 99
= - [2^15 * 17] ÷ 99
= - [2^9 * 2^6 * 17] ÷ 99
= - [512 * 64 * 17] ÷ 99
= - [17 * 64 * 17] ÷ 99
= - [289 * 64] ÷ 99
= - [-8 * 64] ÷ 99
= 512 ÷ 99
= 17

Answer A

Alternatively:
99 is the LCM of 9 and 11

Let us find the remainder for 2^99 ÷ 11:
2^10 ÷ 11 leaves remainder 1
=> 2^99 ÷ 11
= [(2^10)^9 * 2^9] ÷ 11
= (1 * 512) ÷ 11
= 6 remainder

Let us find the remainder for 2^99 ÷ 9:
2^9 ÷ 9 leaves remainder -1
=> 2^99 ÷ 9
= [(2^9)^11] ÷ 9
= (-1)^11 ÷ 9
= -1 + 9
= 8 remainder

Thus, we have a number that leaves remainder 6 when divided by 11 and remainder 8 when divided by 9
The least such number, and hence, our required remainder, is 17

Answer A
GMAT Club Bot
Re: What is the remainder when 2^99 is divided by 99? [#permalink]
   1   2 
Moderators:
Math Expert
92915 posts
Senior Moderator - Masters Forum
3137 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne