Ask
your own question, for FREE!
Mathematics
8 Online
@ikram002p \(\large 13x \equiv 1 (\mod{16})\) how to find the inverse quick without using euclid Answer : 5
Still Need Help?
Join the QuestionCove community and study together with friends!
ok lets try numbers from (1_15) untill we got 1 or -1
13(1) = -3 (mod 16)
-1 is useful is it cuz we can square it then to make it 1 hmm
13(5) =1 mod 16
13(2) = 10 (mod 16)
Still Need Help?
Join the QuestionCove community and study together with friends!
13(3) = 7 (mod 16)
13(4) = 4 (mod 16)
we need to keep guessing like this is it ?
will in this gussing method its usfull oly if u got 1 , -1 when numbers is small like this .. but for large num ecliud is much bettter
oh ok nice :)
Still Need Help?
Join the QuestionCove community and study together with friends!
thank you !
wlc :)
Can't find your answer?
Make a FREE account and ask your own questions, OR help others and earn volunteer hours!
Join our real-time social learning platform and learn together with your friends!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
VERNEISH:
Two objects are moving along separate linear paths where each path is described by position, d, and time, t.
Maci:
what are the best stock apps for people who want to start investing?
Twaylor:
genuienly how do i get better self control i keep watcing youtube and theres this
IzzyCookie:
|dw:1792074056138:dw| Uhm, I don't know where to ask this, but I'm in college welding at my community college, and I need help learning vertical welding for
thehearken:
not sure if this is considered spam, im sorry if it is, but does anyone have tips
19 hours ago
0 Replies
0 Medals
4 days ago
3 Replies
2 Medals
1 week ago
3 Replies
0 Medals
2 days ago
9 Replies
1 Medal
1 week ago
2 Replies
1 Medal