14,696 views
Goldbach conjecture: The hardest nut to crack in mathematics?! ???? In this video, we delve into one of the oldest and most baffling unsolved puzzles in mathematics: the Goldbach conjecture. Mathematicians have been trying to crack this problem for over 250 years - without success! ???? I'll tell you the exciting story of how Christian Goldbach formulated this conjecture in 1742 and even challenged the legendary Leonhard Euler with it. But what exactly does the conjecture say, and why is it so difficult to prove? ???? Together, we'll go through the problem step by step and try to derive the conjecture ourselves. To do this, we'll first use partitions and then prime numbers to gain a deeper insight. Can every even number really be represented as the sum of two prime numbers? ???? At the end, I'll briefly show you the weak Goldbach conjecture, which has already been proven, and why a counterexample to the strong conjecture has not yet been found. If you like the video, please subscribe and tell me in the comments what you want to see next! ???????? 0:00 Easy way to become a millionaire? 1:56 The path to the conjecture 10:39 Formulating the conjecture 11:15 Finding a counterexample 12:38 Goldbach function 14:01 Goldbach comet 15:14 Classifying sets of hits 18:06 New mathematical ideas 18:37 Weak Goldbach conjecture