![]() |
![]() |
#23 | |
"Dana Jacobsen"
Feb 2011
Bangkok, TH
2×3×151 Posts |
![]()
I wrote the script and the Perl module, including the GMP code for sieving, next_prime, and the BPSW test.
There shouldn't be any overlap unless p=11 in the first case. Most of those searches are very low. I have a couple looking for all square-free divisors below 500k but that is only haphazardly running so go for it. Quote:
For PFGW, you could use just a threshold appropriate for the gap size, then use a second little Perl script to cull the candidates based on actual merit. PFGW's nextprime is quite slow unless it has been changed since 3.7.7. nextprime(10^2000) is over 2 minutes vs. 13 seconds for my code. It looks like it increments by two from the previous odd, checks divisibility by the first 500 primes using trial division, then calls David Cleaver's strong BPSW function. The latter is called far more often and the actual test is close to 2x slower than my BPSW code. OTOH, if you're really not running my GMP code, then it would be faster. I'm again surprised it doesn't work with GMP. Code:
perl -Mntheory=:all -E "say prime_get_config->{gmp}" |
|
![]() |
![]() |
![]() |
#24 |
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
16A316 Posts |
![]()
I couldn't install Math::Prime::Util::GMP into activeperl. It needs gmp installing manually. I will try again getting that working at some point.
Currently I am running on linux but I spend most of my time in windows. |
![]() |
![]() |
![]() |
#25 |
"Dana Jacobsen"
Feb 2011
Bangkok, TH
2·3·151 Posts |
![]()
Ah, ActiveState. No GMP libraries on their build machines, so they don't build the module. Strawberry Perl for Windows includes the GMP libraries. It's far better for developers than ActiveState (it even includes a C compiler and make so you can install your own packages rather than relying on ActiveState to do it for you).
|
![]() |
![]() |
![]() |
#26 | |
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
579510 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#27 |
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
10110101000112 Posts |
![]() |
![]() |
![]() |
![]() |
#28 |
"Antonio Key"
Sep 2011
UK
32×59 Posts |
![]()
Here's my stats for this weeks submission (checked against merits.txt dated 2015-10-14).
Maintaining >18 records/day/core, despite taking one (of four) core out to try a few search modification ideas. Nothing spectacular to report, but I live in hope ![]() Code:
Gap - Entries Owner - Improved Rosnthal - 143 Jacobsen - 83 RobSmith - 21 M.Jansen - 17 Toni_Key - 7 PierCami - 4 TorAlmJA - 4 Andersen - 2 JLGPardo - 1 MJPC&JKA - 1 Gapcoin - 1 Total - 284 523 new entries for merits.txt 239 first time gaps found Smallest merit increase = 0.009355 Largest merit increase = 11.372329 Largest merit found = 25.683840 Largest merit (first time gap) = 21.487940 Smallest gap recorded = 13046 Largest gap recorded = 219390 |
![]() |
![]() |
![]() |
#29 | |
Jun 2003
Oxford, UK
2×7×137 Posts |
![]() Quote:
What value are you placing on "my $delta"? If you have this as zero you are doing twice the work you really need. If you are really interested in merits >20, you should set this to a minimum of 8. You get through the range twice as quickly, but are unlikely to miss too many merits >20 |
|
![]() |
![]() |
![]() |
#30 |
"Dana Jacobsen"
Feb 2011
Bangkok, TH
2·3·151 Posts |
![]()
Nice results, and a overall top-20 from Spielauer this week.
I'm still using delta=3. It still gives a nice boost without dropping too many. I am not getting close to that efficiency on most of my searches. Once again contemplating dropping some of the 2*3*5*p / 2*3*5*7*p / 2*3*5*7*11*p ones in favor of something simpler. |
![]() |
![]() |
![]() |
#31 |
"Antonio Key"
Sep 2011
UK
53110 Posts |
![]()
I'm using delta = 2, after some trial runs to determine the effect various deltas would have.
I found that for deltas of 1, 2 and 3 merits the % of gaps with merits >10 that were missed were 6.6%, 9.7% and 18.2% respectively and decided to opt for losing less than 10%. |
![]() |
![]() |
![]() |
#32 | |
Jun 2003
Oxford, UK
2·7·137 Posts |
![]() Quote:
It would be interesting to look at all of your gaps >20 you have found and find what actual prevprime merits were (total merit = prevprime merit+ nextprime merit). My bet is that almost all of the prevprime merits would be >8. |
|
![]() |
![]() |
![]() |
#33 | |
"Antonio Key"
Sep 2011
UK
32·59 Posts |
![]() Quote:
![]() |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
News | gd_barnes | Conjectures 'R Us | 298 | 2021-01-07 09:06 |
News | gd_barnes | No Prime Left Behind | 250 | 2020-06-29 13:23 |
P!=NP in the news | willmore | Computer Science & Computational Number Theory | 48 | 2010-09-19 08:30 |
The news giveth, the news taketh away... | NBtarheel_33 | Hardware | 17 | 2009-05-04 15:52 |
Some news about Home Prime ? | MoZ | Factoring | 6 | 2006-02-28 12:02 |