The Simplest Thing We Can't Prove #shorts
Vsauce2
Dec 21, 2021 17:35
Create an account to hide videos, mark them watched, or save them to Don't Miss.
Create an account to hide videos, mark them watched, or save them to Don't Miss.
Create an account to hide videos, mark them watched, or save them to Don't Miss.
Goldbach's Conjecture states that every even whole number greater than 2 is the sum of two prime numbers. So, 28 is 11 + 17... 62 is 43 + 19... and it goes up. WAY up.
We've calculated every value up to 4 x 10^18, so it's got to be provable, right? WRONG. One guy tried it by hand; now we crunch the numbers with supercomputers and we're still not there. Confirming the Goldbach Conjecture's veracity has been just out of reach since Euler and Goldbach first communicated about it in 1742, and although we don't have any information or analysis to disprove it, we can't say with absolute certainty that Goldbach's Conjecture holds for every even whole number through infinity.
#shorts
Education
#vsauce
#vsauce2
#vsause
#vsause2
#vsauce2 shorts
#goldbach conjecture
#goldbach
#goldbach conjecture proof
#goldbach conjecture explained
#math history
#euler
#math proofs
#math proofs explained
#mathematical proofs
#math shorts
#math short video
#vsauce shorts
#vsauce short video
#educational shorts
#educational short videos
#number theory
#number theory lecture
#number theory problems
#math facts
#math trivia
#math trivia questions
#math games
#math tricks
#math tricks magic