We'd love your feedback! Please take a minute to share your thoughts.

Summer of Math Exposition

When a Formula Doesn't Exist: The World's Oldest Algorithm

Audience: high-schoolundergraduate

Tags: gcdprime-factorizationelementary-number-theoryeuclidean-algorithm

Why can a natural number only be factored in one way as a product of primes? It comes down to an algorithm -- the Euclidean algorithm -- which computes the gcd of two numbers. You can find this in every textbook on elementary number theory. But the way it's always presented, the Euclidean algorithm comes out of nowhere. In this video, I motivate the appearance of the Euclidean algorithm in the proof of unique factorization.



Analytics

7 Overall score*
24 Rank
19 Votes
8 Comments

Comments

7.5

The video has a nice introduction leading to the video’s topic and connecting it to applications. As someone not very familiar with number theory, I didn’t really understand the things stated in the “second application” part. If possible, a little bit more background information would have been better, instead of just saying there is some way of pairing, a theorem and a formula where this is applied without knowing what these are actually about.

Overall, the style of presentation is very nice and the voice is enjoyable to listen to. For some parts of the video it feels like the available screen space is not fully used but I can see why these choices were made.

I think for the average viewer it takes multiple watches and/or actively working on the presented content themselves in order to not get lost as there are many interconnected steps and arguments that can become a bit overwhelming.

Regarding novelty, the Euclidean algorithm has been explained by many people in the past. However, I like how you connect it to the fundamental theorem of arithmetic and other applications to really emphasize it’s importance and show how it is applied.

My long-term takeaways from the video are the following: If I wanted to be reminded how one can prove the fundamental theorem of arithmetic I would come back to this video; and it seems like you do more videos about number theory, so if I feel like I want to know more about it I will also come back.

4.8

Amazing video, just to put it out there. Although, it didn’t stand out too much. Your voice is great, it’s welcoming and slow enough to not get stressed. Although, pretty early on in the video, I got distracted. My guess: not enough practical application or helpful imagery was used to guide me through the theory of this video. Still, good job!

7

Great intro. I was engaged right away. It went by a bit too fast when things got tricky at the end.

7

From my experience, I learned Euclidean algorithm and its extended version from a cryptography class. On the other hand, everyone have heard of the fundamental theorem of arithmetic but may not know how to proof it. Hence, it is exciting to see a video that can connect the dots for me. The vedio is well paced, and the use of numeric example before the algebra is appreciated.

8.3

Very good. Very interesting.

7.2

very easy to follow, and well written.

7.6

Good explanation of the extended Euklidean algorithm, all the steps are very clear.

7.5

Good motivation, good explanations, it’s not really that novel conceptually but I like the way it was introduced. I don’t have much else to say.