mersenneforum.org 4th RPS Drive: 20 more Ks < 300
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2006-07-28, 22:43 #1 Kosmaj     Nov 2003 2×1,811 Posts 4th RPS Drive: 20 more Ks < 300 Actually 21 Ks will be tested for primality in the following ranges of n. Code: Form k*2^n-1 k=205 and 215 ....... 250000 <= n <= 600000 k=203, 211, 217, 241, 245, 259, 263, 265, 271, 275, 281, 283, 287, 293, 295, 299: 260000 <= n <= 600000 k=91 ................ 300000 <= n <= 600000 k=257 ............... 320000 <= n <= 600000 k=109 ............... 350000 <= n <= 600000 We are beginning tests at n=260k taking in account that k=91 is already tested to 300k, k=257 to 320k, and k=109 to 350k, therefore they are not included in test files below these limits (Edit: k=205 and 215 were tested from 250k). We have sieved all above Ks from achieved limits on Keller's page and will do some gap filling later. The priority now is to find new primes Sieveing to 3T done by Dave, Larry, Thomas, and me using ProthSieve but ksieve, NewPGen, and RieselSieve were also used. Important: Please send results of LLR tests to Kosmaj. Thank you! Result Files n=250-400k: zip (1.6M) Happy hunting! Number of new primes found per k: Code:  91 3 215 1 259 6 281 299 1 109 217 3 263 283 203 3 241 3 265 1 287 1 205 2 245 271 4 293 2 211 1 257 1 275 1 295 2 Total number of new primes found so far: 35 The primes are listed on the k<300 Stats page Code:  Range Tested by Status 250,000-570,000 - RPS - Complete (35 primes found) 570,000-571,000 - LSoule - Complete 571,000-572,000 - Arminius - Complete 572,000-573,000 - amphoria - Complete 573,000-575,000 - Kosmaj - Complete 575,000-576,000 - Arminius - Complete 576,000-578,000 - LSoule - Complete 578,000-580,000 - amphoria - Complete 580,000-581,000 - Kosmaj - Complete 581,000-582,000 - Arminius - Complete 582,000-583,000 - LSoule - Complete 583,000-584,000 - Arminius - Complete 584,000-585,000 - amphoria - Complete 585,000-587,000 - Kosmaj - Complete 587,000-590,000 - Thomas - Complete 590,000-591,000 - amphoria - Complete 591,000-593,000 - Kosmaj - Complete 593,000-594,000 - VBCurtis - Complete 594,000-595,000 - amphoria - Complete 595,000-597,000 - Kosmaj - Compelte 597,000-598,000 - Thomas - Complete 598,000-599,000 - amphoria - Complete 599,000-600,000 - Kosmaj - Complete Available Files, sieved to 3T. All files processed! The Drive is over. Last fiddled with by Kosmaj on 2006-12-16 at 13:59
 2006-07-28, 22:54 #2 lsoule     Nov 2004 California 23×3×71 Posts Taking 260-262
 2006-07-28, 23:11 #3 Kosmaj     Nov 2003 1110001001102 Posts I'll take the next one 262-264
 2006-07-29, 00:38 #4 grobie     Sep 2005 Raleigh, North Carolina 1010100012 Posts Taking 264 to 266
 2006-07-29, 08:19 #5 ValerieVonck     Mar 2004 Belgium 34F16 Posts Taking 266to268.txt 1140 268to270.txt 1156
 2006-07-29, 14:40 #6 amphoria     "Dave" Sep 2005 UK 23·347 Posts Taking 270-272.
 2006-07-29, 21:23 #7 lsoule     Nov 2004 California 23×3×71 Posts Taking 272-274
 2006-07-30, 14:12 #8 grobie     Sep 2005 Raleigh, North Carolina 337 Posts 264 to 266 complete (No Primes)
 2006-07-30, 14:30 #9 lsoule     Nov 2004 California 170410 Posts 260-262 complete, no primes Taking 274-276
 2006-07-30, 20:22 #10 amphoria     "Dave" Sep 2005 UK 23·347 Posts 270-272 complete, no primes. Taking 276-278.
 2006-07-31, 04:23 #11 Kosmaj     Nov 2003 70468 Posts Taking also 278-280. Congrats to Larry on the first prime in the 4th Drive: 271*2^274509-1 but maybe there are smaller ones.

 Similar Threads Thread Thread Starter Forum Replies Last Post Kosmaj Riesel Prime Search 373 2020-11-12 15:48 pinhodecarlos Lounge 0 2018-01-26 08:02 MyDogBuster No Prime Left Behind 42 2010-03-21 01:14 mikedressner Riesel Prime Search 2 2009-10-05 04:22 Kosmaj Riesel Prime Search 368 2006-09-06 17:59

All times are UTC. The time now is 21:24.

Sun Feb 5 21:24:14 UTC 2023 up 171 days, 18:52, 1 user, load averages: 0.87, 0.93, 0.98

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.

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