Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
 0 viewing
KingGeorge
Group Title
[SOLVED] Number Theory Challenge (not actually that hard)
Find \(89^{307}\pmod{713}\) without using any kind of electronic aid.
Please at least attempt it before resorting to Wolfram.
Hint: \(713=23\cdot31\).
 2 years ago
 2 years ago
KingGeorge Group Title
[SOLVED] Number Theory Challenge (not actually that hard) Find \(89^{307}\pmod{713}\) without using any kind of electronic aid. Please at least attempt it before resorting to Wolfram. Hint: \(713=23\cdot31\).
 2 years ago
 2 years ago

This Question is Closed

KingGeorge Group TitleBest ResponseYou've already chosen the best response.2
Since I ran out of space on the question: I only decided to ask this because when I was first doing this problem, I quickly discovered I didn't need an electronic aid.
 2 years ago

KingGeorge Group TitleBest ResponseYou've already chosen the best response.2
Hint 2: Use the Chinese Remainder Theorem. You will find it isn't as bad as it usually is.
 2 years ago

zzr0ck3r Group TitleBest ResponseYou've already chosen the best response.0
what is mod? what class do we learn about this?
 2 years ago

KingGeorge Group TitleBest ResponseYou've already chosen the best response.2
It's a number theory function. So \(a\pmod{n}\) returns the remainder of some number a when divided by n. There are a bunch of interesting applications for this, and when \(n\) is prime, you get a bunch of awesome properties.
 2 years ago

KingGeorge Group TitleBest ResponseYou've already chosen the best response.2
It's also called "Clock arithmetic" sometimes http://en.wikipedia.org/wiki/Modular_arithmetic
 2 years ago

zzr0ck3r Group TitleBest ResponseYou've already chosen the best response.0
ahhh ok we used this in computer science
 2 years ago

zzr0ck3r Group TitleBest ResponseYou've already chosen the best response.0
so 8mod(3) = 2?
 2 years ago

zzr0ck3r Group TitleBest ResponseYou've already chosen the best response.0
one more hint, i dont see how the 23* 31 helps unless we could break up the top. into some multiple of 23 or 31
 2 years ago

KingGeorge Group TitleBest ResponseYou've already chosen the best response.2
You need to look at \(89^{307}\pmod{23}\) and \(89^{307}\pmod{31}\) independently. Since these are prime, a bunch of nice properties apply, and you can simplify each to a number between 0 and 23/31. Once you have that, apply Chinese Remainder Theorem. I've got to say though, if this is the first time you've ever really used modular arithmetic, this is still a hard problem.
 2 years ago

zzr0ck3r Group TitleBest ResponseYou've already chosen the best response.0
thats the fun of it:) I got to eat but will be back in a bit to try more
 2 years ago

KingGeorge Group TitleBest ResponseYou've already chosen the best response.2
Extra hints just for you. You need to be somewhat familiar with Fermat's Little Theorem. You also need to know how to find an inverse mod p using the Extended Euclidean Algorithm, and use successive squaring. These are all fairly basic number theory algorithms, and with a little practice, you should be able to get them.
 2 years ago

Ishaan94 Group TitleBest ResponseYou've already chosen the best response.1
\[89^{307}\pmod{23}=15\]\[89^{307}\pmod{31} = 15\]15?
 2 years ago

KingGeorge Group TitleBest ResponseYou've already chosen the best response.2
Right on. Technically it requires an application of CRT at the end (which is not easy to do by hand), but since both are congruent to 15, you can skip that step.
 2 years ago

Ishaan94 Group TitleBest ResponseYou've already chosen the best response.1
Thank you for helping me through.
 2 years ago

KingGeorge Group TitleBest ResponseYou've already chosen the best response.2
How much were you able to do by hand?
 2 years ago

Ishaan94 Group TitleBest ResponseYou've already chosen the best response.1
I used calculator for 13*12*20 (mod 23) and for verifying my answers.
 2 years ago

KingGeorge Group TitleBest ResponseYou've already chosen the best response.2
Excellent job! However, there was an alternative, if slightly roundabout way of finding \(89^{307}\pmod{23}\) without using successive squaring.
 2 years ago

Ishaan94 Group TitleBest ResponseYou've already chosen the best response.1
oh hmm can you show me? or maybe a hint?
 2 years ago

KingGeorge Group TitleBest ResponseYou've already chosen the best response.2
Basically, notice the following.\[89^{307}\equiv 20^{21}\pmod{23}\]By Fermat's Little Theorem, you have that \[20^{22}\equiv1\pmod{23}\]so\[20^{22}\equiv20^{21}\cdot20\equiv1\pmod{23}\]Hence, \[20^{21}\equiv20^{1}\pmod{23}\]So you just need to solve the congruence\[20x\equiv1\pmod{23}\]
 2 years ago

KingGeorge Group TitleBest ResponseYou've already chosen the best response.2
Got to go eat dinner now. Feel free to ask more questions on this and I'll answer them when I get back.
 2 years ago

Ishaan94 Group TitleBest ResponseYou've already chosen the best response.1
I like it, it's much better and simpler than mine. Thank you.
 2 years ago

KingGeorge Group TitleBest ResponseYou've already chosen the best response.2
I love it when I can use it. It was a little trick I learned in my cryptography class.
 2 years ago
See more questions >>>
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
 Engagement 19 Mad Hatter
 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.