|
Author |
Message |
|
TAGS:
|
|
|
Intern
Joined: 20 Aug 2010
Posts: 1
Followers: 0
Kudos [?]:
0
[0], given: 0
|
Remainder of a huge exponent when divided by 7 [#permalink]
 29 Aug 2011, 23:27
What will be the remainder if 47 to the power 203 is divided by 7?
|
|
|
|
|
|
|
Manager
Joined: 28 May 2011
Posts: 200
Location: United States
Concentration: General Management, International Business
GMAT 1: 720 Q49 V38
GPA: 3.6
WE: Project Management (Computer Software)
Followers: 2
Kudos [?]:
28
[0], given: 7
|
Re: Remainder of a huge exponent when divided by 7 [#permalink]
30 Aug 2011, 12:08
Refer http://www.beatthegmat.com/screw-these- ... 81931.html
_________________
-------------------------------------------------------------------------------------------------------------------------------
http://gmatclub.com/forum/a-guide-to-the-official-guide-13-for-gmat-review-134210.html
-------------------------------------------------------------------------------------------------------------------------------
|
|
|
|
|
|
Intern
Joined: 23 Mar 2011
Posts: 13
Followers: 1
Kudos [?]:
0
[0], given: 6
|
Re: Remainder of a huge exponent when divided by 7 [#permalink]
30 Aug 2011, 12:21
I'm not quite sure but the answer is 5
|
|
|
|
|
|
Intern
Joined: 30 Apr 2011
Posts: 3
Followers: 0
Kudos [?]:
1
[0], given: 0
|
Re: Remainder of a huge exponent when divided by 7 [#permalink]
31 Aug 2011, 12:47
Step1:47 and 7 have no factors in common.. therefore we can use the Euler's number of 7(euler's number of a prime number is nothing but 1 less than the value of the number) which is 6.
Step2:Now divide 203 by 6.. remainder is 5.. now the sum is 47 power 5 divided by 7
Step 3: 47 divided by 7 remainder is 5.. now the sum is 5 power 5 divided by 7.
Step4: Answer is 3
|
|
|
|
|
|
Manager
Joined: 28 Jul 2011
Posts: 212
Followers: 0
Kudos [?]:
14
[0], given: 11
|
Re: Remainder of a huge exponent when divided by 7 [#permalink]
31 Aug 2011, 15:03
Vamasiporuri
Can u explain it some more details?
Why in step 2 - "now the sum is 47 power 5 divided by 7" ? what its does?
why in step 3 - "now the sum is 5 power 5 divided by 7." ? how did you derived 5 to power of 5?
Do this method apply for other numbers example:
example: 546 ^ 100 divided by 7
|
|
|
|
|
|
Manager
Status: exam is close ... dont know if i ll hit that number
Joined: 06 Jun 2011
Posts: 209
Location: India
Concentration: International Business, Marketing
GMAT Date: 10-09-2012
GPA: 3.2
Followers: 2
Kudos [?]:
6
[0], given: 1
|
Re: Remainder of a huge exponent when divided by 7 [#permalink]
31 Aug 2011, 18:58
vamsi please make it clear
_________________
just one more month for exam...
|
|
|
|
|
|
Senior Manager
Joined: 09 Feb 2011
Posts: 286
Concentration: General Management, Social Entrepreneurship
GMAT 1: 770 Q50 V47
Followers: 5
Kudos [?]:
88
[0], given: 10
|
Re: Remainder of a huge exponent when divided by 7 [#permalink]
31 Aug 2011, 21:29
The way to solve remainder - exponent questions is to find cyclicity of remainder.
47 ^1 Remainder is 5
47 ^2 = 47*47 Remainder when 5*5 is divided by 7 = 4
47 ^3 =(47*47)*47 Remainder when 4*5 is divided by 7 = 6
47 ^4 =(47*47)*(47*47) Remainder when 4*4 is divided by 7 = 2
47 ^5= Remainder when 5*2 is divided by 7 = 3
47^6 = Remainder when 5*3 is divided by 7 = 1
47^7 = remainder when 1*5 is divided by 7 = 5
We can see that after 6 the remainders will follow the same cycle. Thus remaniders will repaeat themselves with a cyclicity of 6. For 203, there would be 33 full ccyles of 6 and 5 remaining, so the remainder will be same as 47^5 = 3
|
|
|
|
|
|
Intern
Joined: 30 Apr 2011
Posts: 3
Followers: 0
Kudos [?]:
1
[0], given: 0
|
Re: Remainder of a huge exponent when divided by 7 [#permalink]
31 Aug 2011, 23:33
x to the power y when divided by z what is the remainder? Consider this as the sample question. Now if x and z have no factors in common other than 1, that is if x and z are co-primes then follow the steps given below:
1. Find the euler's number of z. Euler's number of a prime number say z is nothing but z-1.
2. Now divide 'y' by the euler's number 'z-1' , let the remainder be 'r'.
3. Divide 'x' by z and let the remainder be q.
4. Now the question boils down to
'q' to the power 'r' divided by z .
|
|
|
|
|
|
Intern
Joined: 30 Apr 2011
Posts: 3
Followers: 0
Kudos [?]:
1
[1] , given: 0
|
Re: Remainder of a huge exponent when divided by 7 [#permalink]
31 Aug 2011, 23:51
1
This post received
KUDOS
kuttingchai.. in the example 47 and 7 are co-primes.. 7 is a prime number. So find euler's number of 7, which is 6.
Now divide 203 by 6..remainder is 5. Now we can replace the power 203 with 5.
The question is now 47 to the power 5 when divided by 7 i.e.. 47*47*47*47*47/7.
47/7 remiander is 5. So the question now becomes 5*5*5*5*5/7.. answer is 3.
Hope this helps u.
This is not applicable to the problem 546^100 divided by 7.. because 546 and 7 are not co-primes.
In general the euler's number of N = N*(1-(1/a))*(1-(1/b))....
where a,b.. are the prime factors of N.
Example.. to find euler number of 18, 18 = 2*3*3(expressing in terms of prime factors)
Euler's no = 18*(1-(1/2))(1-(1/3)) = 18*(1/2)*(2/3) = 6.
euler's no of 18 is 6.
|
|
|
|
|
|
Manager
Joined: 06 Jun 2011
Posts: 162
Followers: 0
Kudos [?]:
12
[0], given: 15
|
Re: Remainder of a huge exponent when divided by 7 [#permalink]
01 Sep 2011, 05:23
Lets see what we get by doing it by binomial theorm.
the theorem states that
(a + b)^n = nC0a^n + nC1a^(n − 1)b + nC2a^(n − 2)b^2 + ... + nCnb^n
Lets assume here a= 49 and b= -2 and n =203
so 47^203 is essentially (49-2)^203.
Now if we expand in other than the last term i.e nCnb^n every other term has a i.e. 49 at different powers. So these all are divisible by 7.
So we have 2^203 which is 8^67*2^2
if we divide 8 by 7 the remainder is 1
so we have 2^2/7 so remainder is 4
|
|
|
|
|
|
Intern
Status: Preparing again for second attempt....
Joined: 11 Dec 2010
Posts: 24
Location: Pune, India
WE 1: 6 years
Followers: 0
Kudos [?]:
3
[0], given: 2
|
Re: Remainder of a huge exponent when divided by 7 [#permalink]
01 Sep 2011, 06:46
I get a remainder of 0.
Every 47 will give remainder of 5. So 47 times 203 will give us remainder of 5 x 203 = 1015. Now we need to divide 1015 by 7 again to check out how many 7's are there in 1015. Since 1015 is divisible by 7, 47^203 is divisble by 7.
|
|
|
|
|
|
Manager
Joined: 06 Jun 2011
Posts: 162
Followers: 0
Kudos [?]:
12
[0], given: 15
|
Re: Remainder of a huge exponent when divided by 7 [#permalink]
01 Sep 2011, 08:21
tssambi,
Every 47 will give remainder of 5. So 47 times 203 will not give us remainder of 5 x 203 = 1015; it will give us 5^203. So this calculation is wrong
|
|
|
|
|
|
Manager
Joined: 06 Jun 2011
Posts: 162
Followers: 0
Kudos [?]:
12
[0], given: 15
|
Re: Remainder of a huge exponent when divided by 7 [#permalink]
01 Sep 2011, 08:58
Sorry my previous answer is wrong It should not be 4 it should be 3.
Here we are using subtraction in the binomial theorem. So this answer should be base on the following theory.
lets consider 23/7.
if we do it by addition i.e 23/7= (21+2)/7 (a=21,b=2) then applying the binomial it is
remainder of 21/7+ remainder of 2/7= remainder of 23/7
21/7 is 0
so 2/7 or 2 is the reminder.
Now lets do it with subtraction
23/7= (28-5)/7 (a=28,b=5) then applying binomial
remainder of 28/7 - remainder of 5/7 = remainder of 23/7
28/7 is 0
-5/7 = -5.
so we should subtract it from the divisor which is 7.
so the remainder is again 7-5 =2
So in my previous answer the theorem remains the correct; only key point is if we are using subtraction in the binomial; we must subtract the end result from the divisor
. i.e. in this case 7-4 = 3
|
|
|
|
|
|
|
Re: Remainder of a huge exponent when divided by 7
[#permalink]
01 Sep 2011, 08:58
|
|
|
|
|
|
|
|
|
|
|
close
