IF Goldbach's Conjecture is UNprovable, well then, it must be true! (via Peter Lynch):
https://thatsmaths.com/2021/03/04/goldbachs-conjecture-if-its-unprovable-it-must-be-true/
"... if it were false, there would be some finite even number that is not the sum of two primes. A finite search could confirm this, making the conjecture 'provably false'! In other words, falsehood of the conjecture is incompatible with unprovability. This contradiction forces us to an ineluctable conclusion: if Goldbach’s Conjecture is unprovable, it must be true!"
1 comment:
Almost a freshman fantasy. True by lack of a counterexample.
Post a Comment