mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Riesel Prime Search

Reply
 
Thread Tools
Old 2014-05-10, 17:12   #254
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

5·7·11·13 Posts
Default

1620-1621 complete, no primes.
Attached Files
File Type: zip SMD_1620to1621.zip (13.0 KB, 85 views)
pinhodecarlos is offline   Reply With Quote
Old 2014-05-10, 18:10   #255
kracker
 
kracker's Avatar
 
"Mr. Meeseeks"
Jan 2012
California, USA

1000011110012 Posts
Default

1662-1670 no primes
Attached Files
File Type: zip 1662-1670.zip (88.4 KB, 71 views)
kracker is offline   Reply With Quote
Old 2014-05-10, 19:40   #256
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

5·7·11·13 Posts
Default

kracker,

About your smilie. Let me teach you one thing I learned. You need a lot of patience to find primes and what I usually think when I reserve a range, rather than always expecting a prime, is to help RPS to clean the low boundaries of k<300 (check here http://www.15k.org/riesellist.html). This means that I am always concerned when the range will be completed than expecting a prime. In this way I won't get frustrated.
Finally primes will appear when you least expect, as often occurs with me.

Happy hunting!

Carlos
pinhodecarlos is offline   Reply With Quote
Old 2014-05-10, 19:46   #257
Nooby
 
Apr 2014

2716 Posts
Default

1590-1591
no prime
Attached Files
File Type: zip 1590-1591.zip (12.8 KB, 81 views)
Nooby is offline   Reply With Quote
Old 2014-05-10, 19:47   #258
Nooby
 
Apr 2014

3·13 Posts
Default

1591-1592 no prime
Attached Files
File Type: zip 1591-1592.zip (12.5 KB, 75 views)
Nooby is offline   Reply With Quote
Old 2014-05-10, 19:51   #259
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

5·7·11·13 Posts
Default

Meanwhile, if noticed, the files are on the server in chunks of 2k up to 1800.
pinhodecarlos is offline   Reply With Quote
Old 2014-05-10, 20:16   #260
kracker
 
kracker's Avatar
 
"Mr. Meeseeks"
Jan 2012
California, USA

32·241 Posts
Default

Quote:
Originally Posted by pinhodecarlos View Post
kracker,

About your smilie. Let me teach you one thing I learned. You need a lot of patience to find primes and what I usually think when I reserve a range, rather than always expecting a prime, is to help RPS to clean the low boundaries of k<300 (check here http://www.15k.org/riesellist.html). This means that I am always concerned when the range will be completed than expecting a prime. In this way I won't get frustrated.
Finally primes will appear when you least expect, as often occurs with me.

Happy hunting!

Carlos
Sorry, semi-wrong smilie. I'm not in it only for finding primes, I was just curious if I was normal and how common or rare primes were in this range.

Last fiddled with by kracker on 2014-05-10 at 20:20
kracker is offline   Reply With Quote
Old 2014-05-10, 22:38   #261
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

10100001000012 Posts
Default

Quote:
Originally Posted by kracker View Post
Sorry, semi-wrong smilie. I'm not in it only for finding primes, I was just curious if I was normal and how common or rare primes were in this range.
There are definitely estimates available to find number of candidates per prime over the long run, provided exponent and sieve depth. Rather than bother with such calculations, refer to post 1 of any team drive and have a peek at how many primes have been recently found. On this drive, it appears we've had 4 primes in the last 100k n-range. This rate is inversely proportional to the exponent, but for current tests it suggests 1 prime per 25k is a reasonable guess for how common primes are. Of course, individual results are in no way regular- 2 primes in a 5k block or 60k without a prime are both entirely reasonable.

I'd provide you the formula for tests per [expected] prime, but I don't have it handy and I'm lazy.
VBCurtis is offline   Reply With Quote
Old 2014-05-11, 00:45   #262
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

362210 Posts
Default

Taking 1680-1684.
Kosmaj is offline   Reply With Quote
Old 2014-05-11, 01:00   #263
kracker
 
kracker's Avatar
 
"Mr. Meeseeks"
Jan 2012
California, USA

32·241 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
There are definitely estimates available to find number of candidates per prime over the long run, provided exponent and sieve depth. Rather than bother with such calculations, refer to post 1 of any team drive and have a peek at how many primes have been recently found. On this drive, it appears we've had 4 primes in the last 100k n-range. This rate is inversely proportional to the exponent, but for current tests it suggests 1 prime per 25k is a reasonable guess for how common primes are. Of course, individual results are in no way regular- 2 primes in a 5k block or 60k without a prime are both entirely reasonable.

I'd provide you the formula for tests per [expected] prime, but I don't have it handy and I'm lazy.
Thanks
kracker is offline   Reply With Quote
Old 2014-05-15, 16:56   #264
kracker
 
kracker's Avatar
 
"Mr. Meeseeks"
Jan 2012
California, USA

32×241 Posts
Default

1670-1680 done. No primes
Attached Files
File Type: zip 1670-1680.zip (111.7 KB, 70 views)
kracker is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
The Third Megabit Drive pinhodecarlos Riesel Prime Search 136 2021-11-20 20:31
The First Megabit Drive Kosmaj Riesel Prime Search 373 2020-11-12 15:48
RPS 11th Drive: Search for more megabit primes Kosmaj Riesel Prime Search 186 2014-12-04 14:03
Any interest in yet another sub-megabit drive? Kosmaj Riesel Prime Search 20 2011-11-17 04:10
The 3rd RPS Drive: low-weight Ks for megabit prime lsoule Riesel Prime Search 140 2009-03-02 15:01

All times are UTC. The time now is 20:33.


Tue Jan 18 20:33:18 UTC 2022 up 179 days, 15:02, 0 users, load averages: 2.06, 1.73, 1.52

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.

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