5 ms·
>So the question really is if there are non self-referential unprovable statements, and the answer seems to be yes Some mathematicians believe that many popula
by Houshalter 10y ago
>So the question really is if there are non self-referential unprovable statements, and the answer seems to be yes
Some mathematicians believe that many popular conjectures are true but unprovable. Like Goldbach's conjecture, Riemann's hypothesis, or perhaps even the collatz conjecture.
We know these things are probably true. If the prime numbers are distributed randomly, there are probabilistic proofs that show the probability of goldbach's conjecture approaches 1, and there is a similar argument for Riemann's hypothesis. However it's just a "mathematical coincidence", there is no reason there can't be a counterexample at 10^500+1, it's just really improbable, so it's impossible to prove.
- theseoafs 10y ago"Very difficult to find a counter example" =/= "unprovable"
- Houshalter 10y agoNo, the point is that there are no counterexamples. The probability of any counterexamples existing decreases exponentially, but is nonzero. So there is a 99.999...% chance that no counterexamples exist, and therefore it is true. But it's impossible to ever prove that.