Results 1 to 3 of 3

Thread: remainder problem

  1. August 30th 2009, 03:27 AM #1
    kandavel879
    kandavel879 is offline
    Newbie
    Joined
    Aug 2009
    Posts
    2

    remainder problem

    solve dis fast..

    find the remainder of 2^89 divided by 89
    Follow Math Help Forum on Facebook and Google+
  2. August 30th 2009, 03:51 AM #2
    ynj
    ynj is offline
    Senior Member
    Joined
    Jul 2009
    Posts
    254
    Quote Originally Posted by kandavel879 View Post
    solve dis fast..

    find the remainder of 2^89 divided by 89
    you may use the Fermat's Theorem:
    a^{p-1}\mod p=1for any prime p,\gcd (a,p)=1
    Then 2^{89}=2(\mod 89)
    The answer is 2
    Last edited by ynj; August 30th 2009 at 04:06 AM.
    Follow Math Help Forum on Facebook and Google+
  3. August 30th 2009, 03:59 AM #3
    kandavel879
    kandavel879 is offline
    Newbie
    Joined
    Aug 2009
    Posts
    2
    Solve and tell the answer
    Follow Math Help Forum on Facebook and Google+
« Congruence/Residue Class | Pigeonhole principle »

Similar Math Help Forum Discussions

  1. Remainder Problem
    Posted in the Algebra Forum
    Replies: 3
    Last Post: March 8th 2011, 10:23 AM
  2. Remainder Problem
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: September 30th 2010, 01:39 PM
  3. Another remainder problem
    Posted in the Algebra Forum
    Replies: 1
    Last Post: July 16th 2010, 03:19 AM
  4. Remainder problem
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: August 17th 2009, 01:33 AM
  5. remainder problem
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: July 22nd 2009, 09:15 AM

Search Tags


/mathhelpforum @mathhelpforum