#Help prove or find a counterexample of my conjecture!
4 messages · Page 1 of 1 (latest)
4 messages · Page 1 of 1 (latest)
My conjecture: Weakest Goldbach's Conjecture
Every odd number greater than 5 can be represented as 2a+b, where a and b are primes
I coded it and the first 10 million numbers work
This is well beyond the scope of this forum.
..didn't the weak Goldbach conjecture take decades to prove?