BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach Starts Oct 17
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Chris Peckover, 100th-Percentile GMAT Scorer

Oct 17 · Chris Peckover
Sat · 11:00 AM to 2:00 PM ET
Oct 20 · Chris Peckover
Tue, Thu · 8:00 to 10:00 PM ET
Oct 25 · Josh Braslow
Sun · 1:00 to 4:00 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemand 5 seats left Start anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

165+ EA score guarantee
$05-day trial no automatic billing
Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Remainder

Expert replies
Source: — Problem Solving |

by nithi_mystics » Thu Jul 29, 2010 2:25 pm
how do we solve this?
Thanks
Nithi
Join the discussion

by 4GMAT_Mumbai » Thu Jul 29, 2010 11:11 pm
Hi,

This seems too tough for GMAT level. Not to say that such types of sums cannot be asked. It could be asked with easier numbers.

a. Instead of 133, the question could have asked for the reminder when 2 ^ 127 is divided by 127.

Here, one could use remainder theorem.

The denominator 127 = 2^7 - 1.

127 = 126 + 1 = (7 times 18) + 1

So, 2 ^ 127 = 2 ^ ((7 times 18) + 1)

= ((2^7) ^ 18 ) times 2.

This is the equivalent of finding the remainder when P(x) = 2 * (x ^ 18) is divided by (x-1), where x = 2^7.

The remainder in this case will be P(1) = 2 times (1 ^ 18) = 2.

b. Anyways, in this question, when 2^p is divided by 133, the remainders repeat with a cyclicality of 18.

Mod (133, 18) = 7.

Hence, the remainder when 2^133 is divided by 133 is same as the remainder when 2^7 is divided by 133. Hence, answer = 128.

Hope this helps. Thanks.[/spoiler]
Naveenan Ramachandran
4GMAT, Dadar(W) & Ghatkopar(W), Mumbai
Join the discussion

by Rahul@gurome » Fri Jul 30, 2010 7:11 pm
Solution:
2^133 = 2^(7*19) = (2^7)^19 = (128)^19 = (133 - 5)^19.
Now (133 - 5)^19 = 133^19 - 19C1*(133^18)*(5^1) + 19C2*(133^17)*(5^2) .............+19C18*(133^1)*(5^18) - 5^19.

In the above binomial expansion all the terms except -5^19 is divisible by 133.
So what we need to do is to find the remainder when 5^19 is divided by 133 and subtract that from 133.

Proceed to find the remainder when 5^19 is divided by 133.
Now 5^19 = (5^18)*5 = (125^6)*5 = {(133 - 8)^6}*5.
Now on expanding {(133 - 8)^6}*5 all other terms are divisible by 133 except for the last term which is (8^6)*5 = {(512)^2}*5 = {(532 - 20)^2}*5.
Now on expanding {(532 - 20)^2}*5 , since 532 is 133*4, all other terms are divisible by 133 except for last term which is (20^2)*5 = 2000.
On dividing 2000 by 133, the remainder is 5.
On subtracting 5 from 133, we have 133 - 5 = 128 as remainder.
Rahul Lakhani
Quant Expert
Gurome, Inc.
https://www.GuroMe.com
On MBA sabbatical (at ISB) for 2011-12 - will stay active as time permits
1-800-566-4043 (USA)
+91-99201 32411 (India)
Join the discussion

by winnerhere » Sun Aug 01, 2010 7:11 am
4GMAT_Mumbai wrote:Anyways, in this question, when 2^p is divided by 133, the remainders repeat with a cyclicality of 18.
Mod (133, 18) = 7.

Hence, the remainder when 2^133 is divided by 133 is same as the remainder when 2^7 is divided by 133. Hence, answer = 128.

Hope this helps. Thanks.[/spoiler]
how did you get to this step.Did you divide from 2^1 to 2^18 manually to find if the reminders repeat? or is there any oher way to find the number of powers after which the remaindr will repeat.

Thanks for your help friend :)
Join the discussion

by winnerhere » Sun Aug 01, 2010 8:11 am
Thank you so much rahul.But isnt it time consuming to convert into polynomials at every step.

Is there is a way , that we can split the 2^133 and 133 into diferent groups and then finding the remainder individualy? Just curious..Dont mind if I sound foolish :)

Thanks,
Join the discussion

by pradeepkaushal9518 » Mon Aug 02, 2010 4:12 am
is it a gmat question what is source?
Join the discussion

by selango » Mon Aug 02, 2010 4:16 am
IMO this is not a GMAT question..
--Anand--
Join the discussion

by winnerhere » Mon Aug 02, 2010 7:20 pm
dont panic guys.This question was not taken from a GMAT source :)

Sorry if I had caused a confusion
Join the discussion