Last visit was: 25 Apr 2026, 08:16 It is currently 25 Apr 2026, 08:16
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: 25 Apr 2026
Posts: 109,827
Own Kudos:
Given Kudos: 105,878
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,827
Kudos: 811,212
 [19]
Kudos
Add Kudos
19
Bookmarks
Bookmark this Post
User avatar
SherzodAzamov
Joined: 20 Jan 2019
Last visit: 17 Jan 2021
Posts: 32
Own Kudos:
189
 [2]
Given Kudos: 29
Affiliations: ACCA
Location: Uzbekistan
Concentration: Strategy, Statistics
GMAT 1: 740 Q50 V40
GPA: 4
WE:Management Consulting (Manufacturing)
Products:
GMAT 1: 740 Q50 V40
Posts: 32
Kudos: 189
 [2]
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
User avatar
Nik11
Joined: 17 Jan 2021
Last visit: 21 Nov 2021
Posts: 99
Own Kudos:
45
 [1]
Given Kudos: 236
GMAT 1: 710 Q49 V39
Products:
GMAT 1: 710 Q49 V39
Posts: 99
Kudos: 45
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
avatar
Abdeviliiers
Joined: 02 Nov 2019
Last visit: 16 Nov 2025
Posts: 6
Own Kudos:
Given Kudos: 231
Posts: 6
Kudos: 2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Reducing each 2(23)+3 to 3 does not change the remainder when this is divided by 23 . (To see this, apply one reduction at a time. Then, one factor gets reduced by a multiple of 23 , and the rest stay the same. Subtract the reduced value from the value before the reduction, and factor out the unaffected factors. What is left is a multiple of 23 . This argument actually works for all remainders when a product is divided by a fixed number.)

Now, what are the remainders when powers of 3 are divided by 23 ?

Exponent Remainder

01

13

29

34 (reduced from 27 )

412

513

616

72

86

918

108

111

So, the remainder when 311 is divided by 23 is 1 . (Fermat’s Little Theorem would be an argument sufficient to prove that the remainder when 322 is divided by 23 is 1 . However, we would still need at least part of the table, as will be seen later.)

This result can be used to lower the exponent on the 3 without changing the remainder after a division by 23 . In particular, 31000=(3990)310=(311)90310 .

Reducing the 311 to 1 and the 310 to 8 does not change the remainder when the product is divided by 23 (by a similar argument as was used to reduce each 2(23)+3 to 3 ). All that is left is (190)8=8 . The remainder when 8 is divided by 23 is 8 , so 8 is the remainder when the original number 491000 is divided by 23 .
User avatar
rsrighosh
Joined: 13 Jun 2019
Last visit: 11 Dec 2022
Posts: 184
Own Kudos:
Given Kudos: 645
GMAT 1: 490 Q42 V17
GMAT 2: 550 Q39 V27
GMAT 3: 630 Q49 V27
GMAT 3: 630 Q49 V27
Posts: 184
Kudos: 137
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel chetan2u VeritasKarishma
Could you please share your approach
User avatar
carouselambra
User avatar
Current Student
Joined: 14 Mar 2018
Last visit: 28 Apr 2023
Posts: 297
Own Kudos:
Given Kudos: 43
Posts: 297
Kudos: 451
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Is there any theorem that we can apply here?
yashikaaggarwal could you please help?
User avatar
CEdward
Joined: 11 Aug 2020
Last visit: 14 Apr 2022
Posts: 1,161
Own Kudos:
Given Kudos: 332
Posts: 1,161
Kudos: 289
Kudos
Add Kudos
Bookmarks
Bookmark this Post
carouselambra
Is there any theorem that we can apply here?
yashikaaggarwal could you please help?
Anytime you see divisibility involving large exponents you have two choices. Unit digits or cyclicity.

Take consecutive powers of 7 (e.g. 7^1,7^2,7^3) until you find the remainder of 1. That will tell you what the cycle is (e.g. it could be q cycle of 3,4,5 etc). Then, once you figure that out, divided the large exponent by that result.

Posted from my mobile device
User avatar
rsrighosh
Joined: 13 Jun 2019
Last visit: 11 Dec 2022
Posts: 184
Own Kudos:
Given Kudos: 645
GMAT 1: 490 Q42 V17
GMAT 2: 550 Q39 V27
GMAT 3: 630 Q49 V27
GMAT 3: 630 Q49 V27
Posts: 184
Kudos: 137
Kudos
Add Kudos
Bookmarks
Bookmark this Post
SherzodAzamov

SherzodAzamov
Hence, \(3^{11k}\) - \(1^k (mod 23)\) = \(3^{11k} - 1 (mod 23)\)

\(3^{1000}\) = \(3^{11*{90}+10}\) - \(3^{10} - 8 \)

a) Could you please explain how did you reach formulating this? Is there any formula u r using?

b) How did u reach the red highlighted part. What is the logic behind it.

c) How did you find remainder of \(3^{11}\). Did you actually calculate \(3^{11}\) and divide by 23 to get the mod?
User avatar
yashikaaggarwal
User avatar
Senior Moderator - Masters Forum
Joined: 19 Jan 2020
Last visit: 29 Mar 2026
Posts: 3,089
Own Kudos:
Given Kudos: 1,510
Location: India
GPA: 4
WE:Analyst (Internet and New Media)
Kudos
Add Kudos
Bookmarks
Bookmark this Post
carouselambra
Is there any theorem that we can apply here?
yashikaaggarwal could you please help?
We can solve using Euler Method.
Since numerator and denominator are co prime.
Then the value of denominator-1 will leave 1 as remainder if we divide denominator by numerator^denominator-1
Here,
49^22/23 will leave remainder 1
Using this,
We are left with 49^10/23
49 can be written as (23*2+3)^10
Opening bracket, 23*2^10 will not leave any remainder.
3^10/23
We can find value of 3^10 = 59049/23 will leave remainder 8
Or you can break 3^10 into (3^2)^5 or (3^5)^2
9 can't be break into 23 value.
But 243 can be break into (23*10+13)^2
13^2/23 => 169/23 will leave remainder 8.

Answer is B

Posted from my mobile device
User avatar
chetan2u
User avatar
GMAT Expert
Joined: 02 Aug 2009
Last visit: 25 Apr 2026
Posts: 11,229
Own Kudos:
45,017
 [2]
Given Kudos: 335
Status:Math and DI Expert
Location: India
Concentration: Human Resources, General Management
GMAT Focus 1: 735 Q90 V89 DI81
Products:
Expert
Expert reply
GMAT Focus 1: 735 Q90 V89 DI81
Posts: 11,229
Kudos: 45,017
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
rsrighosh
Bunuel chetan2u VeritasKarishma
Could you please share your approach


Hi

The question requires Binomial expansion or Euler s formula or some pattern to find your answer.

GMAT would give you remainder questions where you can find a pattern without too much of calculations.
This question is too calculation intensive to find a way in actuals.

You can leave the question as it is more of Indian IIM type question.
User avatar
Nik11
Joined: 17 Jan 2021
Last visit: 21 Nov 2021
Posts: 99
Own Kudos:
Given Kudos: 236
GMAT 1: 710 Q49 V39
Products:
GMAT 1: 710 Q49 V39
Posts: 99
Kudos: 45
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Nik11
I ask to confirm the validity of the following approach (it took me more than 3 min to solve):

49/23 leaves r= 3 ---> 3^1000 that we can write as 81^250/23 leaves r=12 ---> 12^250/23
or 144^125/23 that leaves r=6 ---> 6^125/23 or (3^125 * 2^125) / 23 or (243^25 * 32^25) / 23
this is probably the part that requires a bit of "calculations" since you should multiply 243 by 32 (that gives 7776)
and divide the result by 23 You'll find a r=2 ---> 2^25 (remember that we had: (243*32)^25)
2^25 or 32^5 this leaves a r=9 hence 9^5/23 or 3^10 or 243^2 that leaves r= 13 ----> 13^2 or 169
169/23 leaves the final r=8 IMO B

Is right this approach, isn't it?

Posted from my mobile device
User avatar
carouselambra
User avatar
Current Student
Joined: 14 Mar 2018
Last visit: 28 Apr 2023
Posts: 297
Own Kudos:
Given Kudos: 43
Posts: 297
Kudos: 451
Kudos
Add Kudos
Bookmarks
Bookmark this Post
CEdward
carouselambra
Is there any theorem that we can apply here?
yashikaaggarwal could you please help?
Anytime you see divisibility involving large exponents you have two choices. Unit digits or cyclicity.

Take consecutive powers of 7 (e.g. 7^1,7^2,7^3) until you find the remainder of 1. That will tell you what the cycle is (e.g. it could be q cycle of 3,4,5 etc). Then, once you figure that out, divided the large exponent by that result.

Posted from my mobile device

Thank you and Yashika! :)
User avatar
Fdambro294
Joined: 10 Jul 2019
Last visit: 20 Aug 2025
Posts: 1,331
Own Kudos:
772
 [1]
Given Kudos: 1,656
Posts: 1,331
Kudos: 772
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Not GMAT material but I’ll bite.

Since the Base of the NUM’s exponential term and the divisor are co-prime ——-> can use Euler’s Theorem

The given division can be re-written as:


(3 / 23)Rof ^ [ (1,000) / (Euler no. of 23)]Rof

(3) ^ [ (1,000) / (22) ]Rof

Since 1,000 divided by 22 leaves a remainder of 10

(3)^10 = excess remainder

Since remainder must be < less than < divisor, we need to divide through by 23 again

(3)^10 / 23 ———-> yields a remainder of ?


(3)^3 * (3)^3 * (3)^3 * 3 = (27) (27) (27) (3)

Dividing each factor by the divisor of 23 and multiplying the remainders:

(Rem of 4) * (Rem of 4) * (Rem of 4) * (Rem of 3) = excess remainder

(64)(3) = excess remainder


Dividing each factor by 23 again:

(64/23) ——> Rem of (-)5

*

(3/23) ———> Rem of + 3

Negative remainder of (-5) * (3) = -15


-15 + (Divisor of 23) = 8

8 is the answer

Posted from my mobile device
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,984
Own Kudos:
Posts: 38,984
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
109827 posts
Tuck School Moderator
852 posts