qed
Senior Member
Goldbach conjecture, in number theory, is the assertion that every even counting number greater than 2 is equal to the sum of two prime numbers. 3=1+2, 4=2+2, 5=2+3, ... try it. The Russian mathematician Christian Goldbach first proposed this conjecture in a letter to the Swiss mathematician Leonhard Euler in 1742. While true for every number we have tried, in has never been proved true. Many have tried. While not a Millennium Prize Problem, it is a Holy Grail. I have tried
one holiday.
Recently the conjecture has been proved true by Janusz Czelakowski (who I have met at conference and have referenced). While still to be published in a journal, and hence properly peer reviewed, it has been three years in the coming, and has survived/grown-from a few rounds in the community, Stack Overflow and two rounds on Research Gate. The currently unbroken version is on Research Gate. He uses Universal Algebra (in this case Peano Arithmetic) and essentially Formal Set Theory.

Recently the conjecture has been proved true by Janusz Czelakowski (who I have met at conference and have referenced). While still to be published in a journal, and hence properly peer reviewed, it has been three years in the coming, and has survived/grown-from a few rounds in the community, Stack Overflow and two rounds on Research Gate. The currently unbroken version is on Research Gate. He uses Universal Algebra (in this case Peano Arithmetic) and essentially Formal Set Theory.