Page 2 of 2 FirstFirst 12
Results 11 to 11 of 11

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

  1. #11
    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
    Attached Files Attached Files
    Last edited by RobbeK; 17-12-2013 at 00:46.

Page 2 of 2 FirstFirst 12

Similar Threads

  1. 3D Test
    By peter in forum Sources, Templates, Code Snippets, Tips and Tricks, Do you know ...
    Replies: 3
    Last Post: 29-11-2013, 23:48
  2. Dll-Test
    By peter in forum Sources, Templates, Code Snippets, Tips and Tricks, Do you know ...
    Replies: 7
    Last Post: 13-01-2011, 23:50
  3. Need Test
    By catventure in forum T.A.B. (ThinBasic Adventure Builder)
    Replies: 16
    Last Post: 05-08-2010, 00:11

Members who have read this thread: 0

There are no members to list at the moment.

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •