Uploaded June 2010 | Updated September 2026, 3 weeks ago
Following the video that questions the uniqueness of factor trees, the video on the Euclidean Algorithm, and the video on Jug Filling, we are now, finally, in a position to prove the Fundamental Theorem of Arithmetic. Euclid's brilliance shines on!
Following the video that questions the uniqueness of factor trees, the video on the Euclidean Algorithm, and the video on Jug Filling, we are now, finally, in a position to prove the Fundamental Theorem of Arithmetic. Euclid's brilliance shines on!
![Partition Numbers Part II: An Accessible Overview (Tanton: Mathematics)
[Part II of IV] In January 2011 there was a breakthrough in a famous, tough, unsolved problem in mathematics - finding a formula for the partition numbers. In this series if mini-videos I give an accessible introduction and overview of the mathematics and history of these numbers. We start with childs play, move to the work of Euler and Ramanujan, and then in the final video, attempt to give a sense of what the recent breakthrough is for all those who dont have the high-powered mathematics at hand. Partition Numbers Part II: An Accessible Overview (Tanton: Mathematics)](https://i.ytimg.com/vi/Nen_BbaUEyc/mqdefault.jpg)









