Twin prime search?

[victor]

Well pacionet, I wanted to try something with mediawiki, so I did that :

http://victorftp.free.fr/wiki/

If the twin prime searchers think it is enough, let's use it, else you do something static, pacionet ;)

(Of course if we go on with the wiki, we will improve it, not staying with something almost empty :D )

[grobie]

Originally Posted by MooooMoo

The search method will be like this:

1.) I used the "twin search" feature in NewPGen to sieve out factors less than, say 10 trillion. For those numbers, k*2^n +1 and k*2^n-1 doesn't have a factor less than 10 trillion. The value of k changes, but the value of n does not.

2.) We'll put those numbers in PRP, which will search for primes of k*2^n+1 only.

3.) After a few days, we'll get a list of k's in which k*2^n+1 are prime. We'll then test those k's and see whether any of them are prime for k*2^n-1.

If you know of any more efficient methods, feel free to discuss them.

Unfortunately, I have a limited knowledge of HTML, so unless someone helps out, this project may be coordinated in a subforum for awhile. However, I do agree that this would be much better as a web page.

I got a question? Wondering if I'm missing something:

when you say "twin search" feature in NewPGen do you mean the drop down box & click Twin: k.b^n+-1?

I used that, got my output file, put it in my llr dir, now above you stated:

2.) We'll put those numbers in PRP, which will search for primes of k*2^n+1
only.

I started llr and its testing k*2^n-1 not k*2^n+1 first, do I need to test for +1 with some other program then use llr?

I'm confused??

[victor]

If you have 100 'k' (we keep the same 'n') and will to test for +1 and -1, you'll have to do twice more work than if you just test for +1 or -1, and test the other one if our candidate is prime :)

[grobie]

Originally Posted by victor

If you have 100 'k' (we keep the same 'n') and will to test for +1 and -1, you'll have to do twice more work than if you just test for +1 or -1, and test the other one if our candidate is prime :)

ok, so if I find a prime testing -1 then and only then I'll need to test that prime +1 with what program?

[victor]

With PRP ;)

But when your range will be done, post primes found in the range reservation topic, before checking for +/- 1

[grobie]

Originally Posted by victor

With PRP ;)

But when your range will be done, post primes found in the range reservation topic, before checking for +/- 1

should I be doing my 1st test with prp?

[victor]

MooooMoo explained that as well...

4.) NewPGen will generate a file after sieving is complete. Cut and paste that file in the folder where LLR is in. Run the program, which will do the rest.

5.) After your range is complete, check LLR's output file to see whether you've found any primes. Post any primes here, even if they are not twin primes, and I'll do the rest.

[grobie]

ok thanks I think I got it now!!

[pacionet]

Originally Posted by victor

Well pacionet, I wanted to try something with mediawiki, so I did that :

http://victorftp.free.fr/wiki/

If the twin prime searchers think it is enough, let's use it, else you do something static, pacionet ;)

(Of course if we go on with the wiki, we will improve it, not staying with something almost empty :D )

Yes, nice but I'd like to try a static website, after we decide what is the best (or maybe we decide to take both site, one for sieving and one for search).
I think that before the end of the week I can show you my attempt.

[victor]

Ok, no problem :)

[pacionet]

moooomoo, in the website I have to write that a new user must have a Mersenne forum account to reserve range (to post chosen range in the thread) or we allow also (for the beginning of the project) email reservation (for example you can create a mail box where people who have not Mersenne Forum account can reserve their range ?