News for hackers. Stuff that matters.
Re:GCD and the magic of subtraction by zodiac on Tuesday August 25, 2020 @02:10PM (#24274213)
> If someone has a better explanation of why subtracting relatively prime numbers repeatedly will always result in one, please leave a comment or reach out and help me understand better.

You're looking for a proof of Bezout's identity, or something in the spirit of that theorem :) to be honest, I haven't seen a proof of it that I "really really like", although you might find one

Re:GCD and the magic of subtraction by plumsempy on Tuesday August 25, 2020 @08:11PM (#24277745)
thank you, at first glance I couldn't see its reduction to this case but I will sit with it more. But if you can show me how it applies here I will appreciate that as well.