mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Archived Projects > 3*2^n-1 Search

 
 
Thread Tools
Old 2003-04-08, 03:43   #1
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

22·1,063 Posts
Default Welcome to the 3*2^n-1 search forum

Welcome to the 3*2^n-1 search

This forum is here primarily to help coordinate the search. Search news will be posted here too. If you have any questions then please ask. If you wish to join the search email me please. Each block of work is expected to take two weeks on a 1 GHz Athlon. All sieving is being done by me. In fact, for 'n' to 1 million (roughly 300,000 decimal digits). I will only release numbers for "probable prime testing" when it is optimal to do so (relative to Athlons!) . With the files I send you useLLR:

http://www.mersenne.org/gimps/

Paul Underwood ( paulunderwood@mindless.com )

[edit: added more links]

Last fiddled with by paulunderwood on 2004-04-14 at 11:57
paulunderwood is offline  
Old 2006-03-21, 23:52   #2
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

22×1,063 Posts
Default

Nearly 3 years on and we are testing numbers with 3/4 million digits

Thanks to all for their help.

Join us and have a good chance of finding a world top-20 prime today
paulunderwood is offline  
 

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Welcome to the Prime Gaps Search Forum robert44444uk Prime Gap Searches 2 2019-09-23 01:00
Forum down 10metreh Forum Feedback 33 2010-07-15 14:15
Prime Search forum geoff Forum Feedback 3 2006-07-26 03:17
LMH Forum edorajh Lone Mersenne Hunters 1 2004-01-02 08:30
Forum+Weekends=Dead Forum on Weekends? E_tron Lounge 10 2003-09-03 02:43

All times are UTC. The time now is 14:11.


Wed Aug 10 14:11:36 UTC 2022 up 34 days, 8:58, 4 users, load averages: 2.10, 1.78, 1.68

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, 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.

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