Ask
your own question, for FREE!
Mathematics
11 Online
Find the greatest common divisor (a,b) and integers m and n such that (a,b) = am + bn if a=382, b=26.
Still Need Help?
Join the QuestionCove community and study together with friends!
use euclidean algorithm.
@JRHarrison90 r u familiar with it?
Yup, the extended euclidean algorithm.
Yes but I do not see how to do it with that method.
first find the gcd using it. then write the gcd as a linear combination of 382 and 26.
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
15 hours ago
5 Replies
2 Medals
15 hours ago
12 Replies
4 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