mersenneforum.org Twin prime search?
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2006-04-27, 16:28 #23 victor     Oct 2005 Fribourg, Switzerlan 22×32×7 Posts 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 ) Last fiddled with by victor on 2006-04-27 at 16:29
2006-04-27, 17:12   #24
grobie

Sep 2005
Raleigh, North Carolina

337 Posts

Quote:
 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??

 2006-04-27, 17:37 #25 victor     Oct 2005 Fribourg, Switzerlan 25210 Posts 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 :)
2006-04-27, 18:09   #26
grobie

Sep 2005
Raleigh, North Carolina

15116 Posts

Quote:
 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?

 2006-04-27, 18:24 #27 victor     Oct 2005 Fribourg, Switzerlan 22·32·7 Posts With PRP ;) But when your range will be done, post primes found in the range reservation topic, before checking for +/- 1
2006-04-27, 18:25   #28
grobie

Sep 2005
Raleigh, North Carolina

337 Posts

Quote:
 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?

2006-04-27, 18:37   #29
victor

Oct 2005
Fribourg, Switzerlan

22×32×7 Posts

MooooMoo explained that as well...

Quote:
 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.

 2006-04-27, 18:39 #30 grobie     Sep 2005 Raleigh, North Carolina 337 Posts ok thanks I think I got it now!!
2006-04-27, 18:46   #31
pacionet

Oct 2005
Italy

33910 Posts

Quote:
 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.

 2006-04-27, 18:55 #32 victor     Oct 2005 Fribourg, Switzerlan 25210 Posts Ok, no problem :)
 2006-04-27, 20:13 #33 pacionet     Oct 2005 Italy 3×113 Posts 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 ?

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post jzakiya jzakiya 12 2018-12-11 21:09 hydeer Lone Mersenne Hunters 9 2018-04-03 22:54 cuBerBruce Puzzles 3 2014-12-01 18:15 gd_barnes Riesel Prime Search 6 2007-10-12 18:42 jasong Twin Prime Search 14 2006-12-14 23:16

All times are UTC. The time now is 10:37.

Sat Jan 28 10:37:20 UTC 2023 up 163 days, 8:05, 0 users, load averages: 0.73, 0.96, 0.99

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔