Ask
your own question, for FREE!
Mathematics
14 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
Arriyanalol:
@tinydinoUwU stop trying to find a argument u blad lil boy
TinydinoUwU:
**(Verse 1)** Yo, trapped in a box, Iu2019m feelin' so confined, Lifeu2019s a game of chess, but Iu2019m stuck in rewind, Every dayu2019s a struggle, man, I
Arriyanalol:
hey umm so i need help with my lanauage art ixl anybody wanna help big mama
Nina001:
ho where do i go to buy Subscirption for a moving pfp because on my screen im on
vain:
If the Admins and Mods are ever thinking about a new update for the site; I think what would be cool is that we add a "Profile Music" feature for our profil
Arriyanalol:
so i have a question reading time what is the long hand for then the short hand
3 hours ago
5 Replies
2 Medals
3 hours ago
12 Replies
3 Medals
3 days ago
2 Replies
1 Medal
4 days ago
4 Replies
2 Medals
4 days ago
17 Replies
1 Medal
5 days ago
0 Replies
0 Medals