Math

posted by .

Compute 2^1000(mod 121) using Euler.

  • Math -

    121 = 11^2

    Phi(121) = 11*10 = 110

    1000 Mod 110 = 1000 - 990 = 10

    2^1000 Mod 121 = 2^10 Mod 121

    In the following everything is Mod 121:

    2^7 = 128 = 7

    2^10 = 7 * 2^3 = 56

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. math

    how do we find the least residue of 1789 (mod 4), (mod 10), (mod 101)
  2. math

    how do we find the least residue of 1789 (mod 4), (mod 10), (mod 101)
  3. math

    Which two is true as i'm confused A) 3+7 ß 10 mod 15 17 + 9 ß 4 mod 21 12 + 14 ß 0 mod 26 B) 4+11 ß 2 mod 13 9+7 ß 4 mod 12 13 + 13 ß 1 mod 25 C) 5+9 ß 4 mod 10 16 + 13 ß 3 mod 26 12 + 7 ß 6 mod 14 d)2+7 …
  4. Math

    What are the 3 solutions? I'm stuck! 6x=15(mod 21) a=6,m=21,b=15 d=gcd(6,21)=3 solns. 6x=15(mod 21) 2x=5(mod 7) 21=6(3)+3 6+3(2)+0 0=6-6 6-(21-6(3))=3 6-21+18=3 6( )-21()=3 (21-6(3))(15)-6=3 ?
  5. Math

    Which Statements of congruence are true and which are false and why?
  6. math

    Which Statements of congruence are true and which are false and why?
  7. Math

    Using 10^n = x (mod 9). Given that d=2935107 =2*10^6 + 9*10^5 + 3*10^4 + 5*10^3 + 1*10^2 + 0*10^1 + 7^10^0 Then d = kx (mod 9). What is the smallest positive value of k?
  8. Math

    Which Statements of congruence are true and which are false and why?
  9. Math

    Find all numbers $r$ for which the system of congruences: x == r mod 6 x == 9 mod 20 x == 4 mod 45 has a solution.
  10. math

    Find the least residue of 7^5 mod 50 without using a calculator. so far I have 7=7 mod 50 7^5 = 7^5 mod 50 7^2 = 49 7^3=343 since 7^2=(-1)mod50 and 7^3=(-43)mod50 it follows that 7^6=7^2 * 7^3 = (-1)(-43) = 43 feel like this is wrong …

More Similar Questions