*"Insight can emerge from failure to acccomplish something else."*

*Gerd Gigerenzer*Following my naive attempt to prove Goldbach’s conjecture, I found an algorithm for calculating the Goldbach’s numbers. The calculator you can see HERE is created (based on the same algorithm) by the talented programmer, engineer, photographer and aviation historian Plamen Antonov.

They say a picture is worth a thousand words. See on the left Plamen's picture of my words.

Here's my algorithm for the Goldbach calculator:

**Step 1.**Take Х (an even number greater than 4) and divide it by 2.

**Step 2.**Check if the numbers are even. If they are go to Step 3, otherwise go

to Step 4.

**Step 3.**Add 1 to the first number, and subtract 1 from the second number.

**Step 4.**If X1 and X2 (the numbers resulting from Step 1, Step 3 or Step 5) are prime, i.e. if when divided by odd numbers lesser than them (excluding 1) there are remainders existing, then print X1 and X2.

**Step 5.**If X2=3 stop calculating, otherwise add 2 to X1, subtract 2 from X2 and go to Step 4.

**P.S.**

**18 July 2014**

Now that I am used to thinking about numbers and have a 10-day experience in programming, I can do the above with Wolfram Mathematica.