Remainder

Question

Find the remainder of 2^133 divided by 133 1) 1 2)2 3)128 4)131 Not sure if it is GMAT type sum. Still, any help is appreciated Thanks, Sai

nithi_mystics · Answer

how do we solve this?

4GMAT_Mumbai · Answer

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

Rahul@gurome · Answer

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)

winnerhere · Answer

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

winnerhere · Answer

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,

pradeepkaushal9518 · Answer

is it a gmat question what is source?

selango · Answer

IMO this is not a GMAT question..

winnerhere · Answer

dont panic guys.This question was not taken from a GMAT source Sorry if I had caused a confusion

Choose how you want to prepare

Get Ready for GMAT Test Day Faster with Live Online Classes

Target Test Prep EA OnDemand

Target Test Prep GMAT OnDemand

Remainder

GMAT/MBA Expert

Chicago Booth

GMAT Course Reviews

Admissions Consulting Reviews

FREE GMAT PREP RESOURCES

GMAT PREP DEAL TRACKER