logistic_guy
Senior Member
- Joined
- Apr 17, 2024
- Messages
- 2,213
Suppose \(\displaystyle a = 57970\) and \(\displaystyle b = 10353\). Apply the Euclidean Algorithm and show that \(\displaystyle (57970,10353) = 17\).






Please include the PROPER "statement" of Euclidean algorithm that is expected to be used here.Suppose \(\displaystyle a = 57970\) and \(\displaystyle b = 10353\). Apply the Euclidean Algorithm and show that \(\displaystyle (57970,10353) = 17\).
![]()
Thank you a lot professor Harry. I didn't see how Khan solved it but it was very helpful to know that this notation means the \(\displaystyle \text{GCD}\) (The Greatest Common Divisor). I will try to solve it without cheating as I always do.
\(\displaystyle \frac{57970}{10353} = 5 + \frac{6205}{10353}\)this notation means the \(\displaystyle \text{GCD}\)