mersenneforum.org stats on 15k
 Register FAQ Search Today's Posts Mark Forums Read

 2004-01-11, 05:56 #1 jocelynl   Sep 2002 2·131 Posts stats on 15k Hi all, I just updated the stats. I have tested small n`s with trial factoring to test primality, and found quite a few. Our newest best candidate is 2995125705 with 115 prime found to (200000) and a curve 10^((0.1364*i+0.1019)^(3/5)) I think we should stop 210885 at (450000) or (500000) since it hasn't been producing much lately. We should take 2995125705 to (400000) and see how it goes. The problem remains the sieving! What should we do? Joss L15.
 2004-01-11, 11:56 #2 SlashDude     Aug 2002 Minneapolis, MN 22·3·19 Posts I agree :) I am planning on stopping 210885 at n=450,000. I have already started sieving 2995125705 for n=200,000 to 1,000,000. Can someone send me ksieve? I can't get to fatphil's web site....I get the 403 error cause of my location... Thanks!
 2004-01-11, 14:34 #3 Thomas11     Feb 2003 27×3×5 Posts Slashdude, I have sent you an email containing the Linux and Windows binaries of Ksieve. -- Thomas.
 2004-01-12, 00:24 #4 jocelynl   Sep 2002 2·131 Posts Slashdude will you make it available on 15k.org ? Joss
 2004-01-13, 14:24 #5 Kosmaj     Nov 2003 70468 Posts It sounds reasonable to try another k, but it will be nice if people who reserved ranges of k=210885 almost a month ago tell us their status, and when can we expect them to return results. There are still chances that 210885 is a good candidate if, for example, ET_ finds a prime in the 355-360K range and we find another one for n<450,000. OTOH, if there is nothing all the way to 440K (my range), then it looks like a large gap (the last prime was at 315K by SlashDude), and the next prime should be imminent (?) Since n=440K means 132,000 digits maybe we should continue until we find it. BTW, in my 435-440 range there is nothing up to 439,000. It will be completed in 1-2 days. As for ksieve, it can work with a single k, but I heard it's more efficient when sieving several k's at the same time. I also wonder is it possible to switch from NewPgen to ksieve when sieving is in progress (say, sieved to 100bn).
2004-01-13, 15:45   #6
SlashDude

Aug 2002
Minneapolis, MN

22·3·19 Posts

Quote:
 Originally posted by jocelynl Slashdude will you make it available on 15k.org ? Joss
If you can't download it from http://fatphil.org/maths/ksieve/ - Private message me, and I'll send you a link to the ksiece2bin.tgz file on www.15k.org (Unless Phil doesn't want us to make his software available without using his web site - Phil, if you want me to remove the ksieve file, let me know and I will remove the easy to guess link. :)

Quote:
 Originally posted by Kosmaj As for ksieve, it can work with a single k, but I heard it's more efficient when sieving several k's at the same time. I also wonder is it possible to switch from NewPgen to ksieve when sieving is in progress (say, sieved to 100bn).
I'm sure I can merge the file I already have from NwePGen with the results from Ksieve! I have sieved 2995125705 through p=310 billion. I am working on testing ksieve, and so far, everything looks good!

With the larger k's, ksieve is by far faster then NewPGen! I haven’t tested it with multiple k's, but the single k ksieve for large k's (k>2^31) is by far faster - A P4 2.6GHz machine sieving k=2305225065 completed 40 billion p's in about 8 hours!

If I have time, I'll look at the timing for multiple k's. Right now, using single k ksieve is a huge speed increase!! I should have the group sieve for 2995125705 setup soon!

Thanks again everyone for your help!!!
-Mark

 Similar Threads Thread Thread Starter Forum Replies Last Post Fred PrimeNet 7 2016-02-10 14:48 opyrt Prime Sierpinski Project 3 2010-05-31 08:13 em99010pepe Sierpinski/Riesel Base 5 66 2008-02-06 19:42 em99010pepe NFSNET Discussion 8 2005-07-05 03:22 HiddenWarrior Hardware 2 2003-08-13 14:39

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

Sat May 21 14:40:56 UTC 2022 up 37 days, 12:42, 0 users, load averages: 1.04, 1.16, 1.28

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.

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