Goldbach's claim: every even natural number ##n>4## can be written as a sum of two prime numbers.
Let's call this claim: G(n).
Let's try to solve it by induction.
For n=6=3+3, base check is correct.
Suppose G(n) is correct and let's try to prove that it implies G(n+2) is correct as well...