Computer Algorithm From 300 B.C.

Let's explore and learn an ancient mathematical method described by Euclid around 300 B.C. We apply it to the problem of tiling a 70 x 98 meter field with square plots, and demonstrate how this algorithm can efficiently find the answer for the greatest common divisor. If you enjoyed watching this video, please like and subscribe for more videos like this!
Whether you're a math enthusiast or just curious about practical applications of algorithms, this video is for you! Watch as we break down the steps and I show you how to implement this in Python.
- I made these animations made with motioncanvas.io, what a great tool!

[@brants2000]

Love the history lesson and the math. Great job.

[@samobot]

Thanks for the kind words! This was definitely a fun one to make!

[@OMFGxIamxAxNinja]

I've been loving how you've been experimenting with your recent videos, you've become better and better!

[@samobot]

Thanks for saying that and following along! Yes I've been trying out different things and it's both fun and a tad stressful trying to figure out where to apply the right kind of effort to make enjoyable and better quality videos. Feedback like these comments and hearing you like this helps a lot!