Yes and I have the proof for it, but will leave it as an exercise for the other comments to prove it 😊
1 month ago | 1,300
when the strong goldbach conjecture is presented as a trivial quiz question 🥀🥀💀
1 month ago | 969
veritasium trying to find someone that can prove that as a trivial question 💀
1 month ago | 205
Let's say, hypothetically, for the sake of the argument, that there is an even number greater than 2 that cannot be expressed as the sum of two primes. So this even number would be different from the rest and would stand out, either having a great life or a really bad one. Regardless, this radical difference in the lifestyle of the number will cancel it out from the fermi-fibonacci equation, i.e., F=NC², and therefore would annihilate itself due to its instability. Unless, there are more than one of them, which would make them a minority, facing discrimination and effectively expelled from society and subjectively considered "unnumbers". However, objectively they would exist as numbers but since numbers are abstract, they will come to know this and together eradicate the "unnumbers" from existence. Therefore, we come to the conclusion that even numbers greater than two that cannot be expressed as the sum of two primes CANNOT exist due to their instability in the numerical society. I rest my case.
1 month ago | 6
i have discovered a marvelous proof, but this comment section is too narrow to write it
1 month ago | 26
(common mistakes at the end) I answered every comment of people that were confused in some way so far, but I'll say it here too. (btw got 83% on the quiz, it was nice relearning what I had forgotten :D) This is the strong Goldbach conjecture. The answer is "we don't know, but it probably is right", since it's been tested up to very big numbers, and the number of ways you can write even numbers as two primes seems to be increasing the bigger the number is as far we can tell (in other words, the probability of there being at least one solution seems to be increasing) But there hasn't been any proof yet. There has been proof for "Every odd number greater than 5 can be written as the sum of three primes", which is the weak Goldbach conjecture, but none for the strong one. Some common mistakes people made in the comments: - this conjecture is about even numbers, that is numbers that have 2 as a factor. Yes, 3 can't be written as the sum of two primes, but that's not what we are talking about. - 1 isn't a prime. Primes, or prime numbers, are numbers that have exactly 2 factors; 1 and themselves. 1 only has 1 factor, itself. - This question is about the sum of two primes, that is p+n, where p and n are prime numbers, and p can be equal to n. You can't use any other operations, such as powers, nor more numbers. - 4 is in fact 2+2. This is allowed. Feel free to ask question in the replies, I have plenty of time to answer and will do my best to do so.
1 month ago | 38
Seems like one of those things which may be true for very large sets of numbers but can't be proved.
1 month ago | 97
Probably, although it would be really interesting if the rule suddenly had an exception at like 10^150 or something lol
1 month ago (edited) | 3
"The proof of this is trivial and is left as an exercise for the reader" 💀🙏 ahh mome
1 month ago | 74
Because bread tastes better than the key.
1 month ago | 57
Fun Fact : when Jesus walked the Earth, Euclid had already completed his Elements of Geometry .
1 month ago | 192
Crazy how I watched the video three weeks ago and had no prior knowledge of the subject, yet the video was so explained so well that I easily scored 100% on this test three weeks later
1 month ago | 2
The strong goldbach conjecture!!! It can definitively be written as the sum of four primes though!!
1 month ago | 1
You're right, and i hate it. I'm trying to find even numbers that can't be made with two prime numbers.
1 month ago | 2
Yes Cz an even number can either be represent in powers of 2 or even multiples of an odd number If it's powers of 2 then we can just add that many number of 2's(which is a prime number) If it's even multiple of odd no.s then we can always represent these odd numbers in terms of other of prime odd numbers and then we add that many number of odd number In the end multiplication at its core is just repetative addition
1 month ago (edited) | 3
Veritasium
Quiz time!
Do you understand Goldbach's Conjecture? beta.retainit.app/game/goldbach?r=veritasium
1 month ago | [YT] | 4,396