... repdigit, so two word records in one prime (again: see message #2403) ... digits !!! ... Well done. You might like the print out of the decimal expansion...
... David, 2^364289-2^182145+1 in binary looks like: 111..111000..001 Not a palindrome, not even on a two digited soul As for the "Phi's" I can't say... Paul...
... You can see all in the Patrick De Geest's site: http://www.worldofnumbers.com/em_wing.htm ... I use a home sieving programme with GMP (only up to 2^31) ...
Daniel Heuer
heuer@...
Feb 6, 2003 6:54 am
3043
... Correct me if I am wrong but I think these are the top binary near repetitive digit primes (Binary NRD): 898 7*2^177977-1 53578 gb 2000 ...
Yes, I reckoned that the answer was: none of the above. The ones with +1 at the end should have -1. And I think that the Phi's have the same defect. So Daniel...
(What follows is only meant for those who are interested in ECPP.) The following list of primes is intended to give you an impression of how uncertain ECPP...
Thanks for the stats, Hans. No time to digest the version-variance now, ... As a 2.0.x user, I'm interested. However, Marcel has wiped himself out of the...
... Please cancel that; I now see it was Tx 2.1.0. So my belief that Primo 2.0.6 is state-of-art is intact. I am _very_ happy with Primo 2.0.x. David...
... and don't criticise what you can't understand ... ... the old versions were rapidly changing ... ... if you can't get a new one, then just lend a hand ... ...
I found the actual words: http://www.newyouth.com/archives/music/bobdylan.asp ... but I quite like my own mis-rememberings. David (unreconstructed 60's...
Ah, Bob Dylan, whenever I'm feeling down, I use to listen to that song. Bob Dylan-songs are what I'm listening to when searching for prime numbers (and also...
... 2 2^394034-3 118617 M. Frind & P. Underwood 09/2002 4 2^354946-3 106850 M. Frind & P. Underwood 08/2002 Are larger *but* they are only PRPs ;-) Not much...
Paul: Those 111....101 binary near-repunit PrPs are impressive but if you had gone for pali as well, then they would have been provable, I think? David...
... Yes the pailindromes would be provable beacuse then 50% of N+1 would be divisible by 2 only. The 111..101 pattern was chosen because the FFT PRP test PFGW...
Hi y'all, Which is quicker for 3*2^n-1 search? PRP.exe -- http://www.mersenne.org/ -- the site is down so I can't bench it? Or PFGW? Or Proth? If PRP.exe is...
Hi Paul, ... I would say that PRP and PFGW will do a PRP test at the same speed. Proth will be slower. ... Here I would say LLR - it can perform a primality...
Thanks for your advice Paul but, on my P4, LLR wins outright; no need to do extra proving algorithm as well! I wonder what DWT timings we could expect in...
I would hate to see your posts vanish (I miss being able to research some of Marcels, but I guess that was his choice). If you want to delete them, then simply...
These are the timings on my Athon XP1700+. WinPFGW marginally wins the PRP race on this machine :-) (whereas LLR won by 10% on the P4.) WinPFGW results: ...
I see the same on my Athlon XP 1800+. Once the proving time for found PRP's is added to the WinPFGW times, it looks like LLR is the program to use across the...
... found ... program ... This is the state of play most certainly with P4s. PFGW is still quicker than the others at PRPing on Athlons. Certainly LLR should...
Paul, What range of n are you intending to sieve for this 3.2^n-1 search? Because the fastest software would probably be a slight variant of the SoBSieve ...
... I have a fixed-k sieve that on my machines is between 4 and 10 times faster than the NewPGen 2.71beta. It makes no assumptions about k, and is ready to run...
Hiya Paul I will be sieveing in blocks of 100,000. It is already done by Keller et al to n=191600. I will sieve the first block, fragment it, upload it to...
Hiya Phil, I have DJGPP under Windoze. If you send me the source for your sieve I will compile it and compare it to NewPGen 2.70. The ABC/NewPGen format...