[bsquared]

Originally Posted by JohnFullspeed

Procedure Veri_GoldBack(L:Qword);
 Var I,J,W:integer;
     M,N,R: Qword;
     e2: double;
    Label LN;
 begin
    I:=0;
    HH:=0; // Le nombre  - le NP
    N:=Primes[200]+1;  /// for testing Not 0  1223
    a1 := GetTickCount;     //timer
    Offset:=0; // sortie
    repeat
     LN:
     N:=  N+2;
     If N>200000 then Break;// stop here
     j:=1;
     repeat
       HH:=N-Primes[j];   // test des divisions
       if not Is_Div(HH) then  Goto LN;
       J:=J+1;
     until J> 20;
     I:=I+1; // not found
   until  i>1000;
    a1 := GetTickCount-a1;

Like you can see ,I verify since
N=1223+1 even. The step is 2 (even) and I stop at 200 000
So I do 99 383 verifs

I won't bother debunking the inner loop, but how can you claim to verify up to 200000 if you only run 1000 iterations of a loop that increments N by 2?