Loading rubbish...
We proposed the "Grand Unified Conjecture of Primes" stating that all prime numbers are odd. The reviewer disproved it in the margin with a single counterexample: 2. We retract the conjecture but stand by our methodology.
All prime numbers are odd.
Consider p ∈ ℙ. Since p > 1 and p has no divisors other than 1 and itself, clearly p must be odd because... reasons.
"What about 2?" — Reviewer 1
We thank the reviewer for this devastating observation.
Log in to submit a review.
No reviews yet.
No replies yet. Be the first to comment.