A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

anonymous

  • 4 years ago

If 7^(1983) is divided by 100, what is the remainder?

  • This Question is Closed
  1. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    43

  2. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    but how? could you explain it a bit more?

  3. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    There are many ways we could solve this, I have used Binomial + Euler-Fermat's theorem.

  4. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    I am only a year 8 and I can understand the binomial formula but it would take too long and I don't really understand the Euler Fermat's theorem.

  5. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    and this is from your text book?

  6. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    from tutoring haha

  7. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    well they wouldn't have put it in the test if it was too hard but thanks anyway (:

  8. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    You don't need Fermat or Euler or Binomial Theorem! Here : \[7^{3} = 43 \mod 100 \implies (7^{3})^{661} = 43^{661} \mod 100\] Observe that 1983 = 3 * 661.Therefore it suffices to find the remainder when 43^661 is divided by 100! \[43^3 = 7 \mod 100 \implies 43^6 = 49 \mod 100\] \[\implies 43^{12} = 49^2 = 2401 = 1 \mod 100\] \[\implies (43^{12}) ^{55} = 1 \mod 100 \implies 43^{660} = 1 \mod 100\]

  9. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Now just multiply both sides by 43.You have your answer! NOTE : The" = " stands for congruence.

  10. nikvist
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    \[7^4\equiv 1\enspace(mod\enspace 100)\]\[7^{1980}=(7^4)^{495}\equiv 1\enspace(mod\enspace 100)\]\[7^{3}\equiv 43\enspace(mod\enspace 100)\]\[7^{1983}=7^{1980}\cdot 7^{3}\equiv 43\enspace(mod\enspace 100)\]

  11. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    very fancy math. here is how a bone head does it, in case it is not clear. \[7^0=1,7^1=7,7^2=49,7^3=343,7^4=2401\] and once you see the "one" at the end of 2401, you know the pattern will repeat so that when you divide by 100 you only have 3 choices of remainders, 1,7,49,43 and they repeat in that order. to figure out which one you have, divide 1883 by 4 and take the integer remainder, which is fairly clearly 3 because 4 divides 1880 evenly, leaving 3 as the remainder. so your choice is \[7^3=43\]

  12. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    *4 choices of remainder obviously, sorry

  13. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Don't complicate it satellite!

  14. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.