Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the fascinating world of Schur numbers through this 17-minute mathematical video featuring Sophie Maclean. Delve into one of mathematics' most computationally intensive proofs, examining how Schur numbers relate to combinatorial problems and partition theory. Learn about the mathematical concepts behind what's considered "the world's biggest proof" in terms of computational complexity, discovering how mathematicians use advanced techniques to solve problems involving the coloring of integers and avoiding monochromatic solutions. Understand the connection between Schur numbers and Ramsey theory, while gaining insight into how modern mathematics relies on both theoretical frameworks and massive computational power to tackle seemingly simple questions that lead to extraordinarily complex solutions.
