Nevertheless, I thought I would publish it anyway. Here is the write-up, maybe someone can see a way to fix it: Proof Attempt Regarding the Goldbach Conjecture by Philip White April 9, 2026 (In this write-up, != means "is not equal to.") The Goldbach conjecture states that every positive even number can be written as the sum of two positive prime numbers. We can re-write this conjecture in the following way: For every positive integer Q > 2, there exists a natural number v s.t. 0 < v < Q and both Q-v and Q+v are positive prime numbers. We can re-write the concept of primality using a logically equivalent condition: We say that an integer L is prime if, for any integer J >= L, for all prime numbers p_i, written as p_1, p_2, ... , p_k, from 2 up to the square root of J inclusive, sqrt(J), we have that for all integers i in 1, 2, ... , k, it is the case that L (mod p_i) != 0. Now, since by the Chinese Remainder Theorem, every integer Q is equal to exact...