Euclid's Algorithm - Numberphile

Transcript

So today we're going to talk about Uklid's algorithm. Um so give me two numbers Brady. Two three-digit numbers. Let's say >> three-digit numbers. >> 484 >> 484 >> 781 >> 781. So we're going to find the greatest common divisor of these two numbers. Um so that's going to be the largest number that divides both 484 and 781. >> Oh, I didn't give you a ... Read More