TB with and without O2 - Goldbach's conjecture as a test.

[RobbeK]

Hi Jack, I've been too hasty then switching between those basics :-c thanks !

Hi Mike, perfect -- just what I needed !
Predicting the size of the string is something else ... as usual with prime numbers , when you open a door you find a new closed one ;-)

I mean, I can think of a system to calculate their size , but ...

(the idea is next)

Using the Gauss Legendre pi(x) function which gives an estimation of the number of primes below an upperlimit.
For the Goldbach numbers below N , you take first the ones composed with 3 then 5 , 7 .... then we get
Sum=pi(N-3) + pi(N-5) + ... pi(N-p) + .... + pi(N/2) where p=is prime and < N/2

(and pi(x)=x/ln(x) )

so , once again we need primes to calculate something about primes.

I was hoping to find something by setting up an X-axis not by the natural numbers but by just the prime numbers ---
(in the attached program the green is the Gauss-Legendre pi(x) - by morphing the X axis it became linear now )

best Rob