1) Message boards : Sophie Germain Prime Search : Sophie Germain Prime Search (Message 36544) Posted 3063 days ago by JFS Hi Sorry for my poor english. I m french I a prefered lear women than other language ... I'm not mathemetician but inbformatician* My goal is to done max computer power to the scientist not to do heir jobs I 'm not able to create a sieve but give me the idea and I make the max powerful application(I try...) Interested by twin( I have a twin brother) I download TPS code and I don't belive it: 35 pages of code,1 or 2 G of RAM, X G of HD space and year of cpu To do a Sophie Germain search you need 10 liines of code, no ram,no hd, You(mathematicians) find that a Sophie number is can be write 6k-1 So we only have to compute all caandidas verify if is_Prime add 2 and verify the primarity of the new walue You don't realaese the importanec ,for computer,of this We can write a stieve 10 times more speed hat Erasthotèène!!!!! the naif code ot search twin smaller then 1 000 000 is: B:=1000000; A:=5; // we begin with 11 a:= (6 *1) -1 repeat A:= A+6; If Is_Prime (A) then if Is prime(A+2) then begin Inc(Offset) twins[offset]:=A; end; until A>B; With this sieve no first attemp to eliminate candidat, no RAM, no Hd direcly the number of candidats. B div 6 =166667 primeity tst You can make the resarch on a Phone(Idea to BOINC) AND DON'T FORGET it' the naif code : it's easy to do speeder What is the WR for Twin? 120 000 Digits? Jerôme