Do you need to find the greatest common divisor of two numbers?

Just add them together until you can't add anymore.

This works because the greatest common divisor of a and b is equal to the greatest common divisor of a and b - a.

And "adding" one number line to another is essentially calculating the difference.

The second animation starts with 34 and 55.

These are two neighboring Fibonacci numbers, and the process descends through the entire Fibonacci sequence to 1. A beautiful proof that neighboring Fibonacci numbers are mutually prime.

••••••••••••••••••••••••••••••••••••••••••••••
🤖 Data & ML | @DataXplore