The record for a generalized Lucas number in http://primes.utm.edu/primes/page.php?id=67876 has a lifetime of, at most, a couple of months. Its demise is...
With the helper http://physics.open.ac.uk/~dbroadhu/cert/b5039u.fac OpenPFGW gives ... After Primo has proven prp4660 = primU(11200,-1,5040)/383041 the...
Happy New Year to All: Based on my Residual Factorization Method described in www.csulb.edu/~mbrown10 I can compute the first digits of RSA factors. I would...
Milton Brown
miltbrown@...
Jan 5, 2004 1:33 am
4098
...will come up soon. HRJA Still! without verification......
Phil and I were chatting over yuletide about GenLuc proving. I promised to post some stats in the gigantic regime. Here are stats for lucasU(p,-1,n) and...
... I am an admirer of this primeform and am actually in the midst of proving a 10000+ digit prime with Phil. It has 5000+ digit prime primitive that's being...
Thanks Raffi for indentifying yourself as Phil's other GenLuc correspondent. I look forward to adding your gigantic to the "proxime accessit" section of ...
... From: Milton Brown [mailto:miltbrown@...] Sent: Monday, January 05, 2004 6:52 PM To: 'grostoon'; primenumbers@yahoogroups.com Cc:...
Milton Brown
miltbrown@...
Jan 6, 2004 2:54 am
4103
Hello all, happy new year with the probable smallest probable prime of 100000 digits... 10^99999+309403 is 3, 7 and 137 PRP I think, it is too difficult for...
... Rarely. Take the family that includes the classic Lucas case, namely V(p,-1,(p^2+4)*odd) with odd p. [This includes L(5*odd) at p=1] Because the...
... which it is forbidden to run in Canada, Japan or USA: http://www.ellipsa.net/misc/downloads.html Note that the current Primo top-20 is entirely from the...
... up ... Thank you for elucidating my understanding. I previously was unaware of existence of any classic lucas case. I understand your explanation. ...
Hi David, ... There should be a top 10 from Australia in the next couple of months Using primo 2.0.0 beta 6 (it was current when I started the proof). Proof...
Two more NTGs will soon be proven: prp12237 = primV( 4405,-1,3359) prp14025 = primV(14926,-1,3361) These will have WL proofs, when Primo has done the prp2790...
PS: The smaller of these 2 new NTGs in fact gives a BLS proof conditional on a Primo proof of primV(4405,-1,1680)/(10079*134401) is 137-PRP! ... They don't...
Congrats to Yves for http://primes.utm.edu/primes/page.php?id=68012 in the top-3 GFNs. That's 5 at 2^17. What chance 2^18? It seems to need about 2^3/5 - 1 =...
Hi Hans, Finally a definitive answer to your challenge I have finished proving my CPAP3 9341#+14371913+n*4068 (n=0-2) (digits:4007) are consecutive primes. A...
Dear Primeform participants: I know of a way to find pseudoprimes of any size using the primorial. For example, if the pseudoprime 9337#+582650759 turns out to...
One day, but not in the forseeable future, I'll get Phil to write a very fancy sieve that gives the edge to a non-Primo CPAP3 construction, at 6k+ digits. But...
... That's off-topic, since it's got nothing to do with primes in arithmetic progression. It's also off-brain. If you can do it (as previously claimed) at...
...search is currently at gap length 973000. This search is still ongoing. Hans PS: Seems to become a _very_ hard verification task for Paul Leyland ;) PPS:...
... From: Milton Brown [mailto:miltbrown@...] Sent: Friday, January 09, 2004 5:21 PM To: 'Jean-Louis Charton' Cc: miltbrown@... Subject:...
Milton Brown
miltbrown@...
Jan 10, 2004 1:24 am
4122
Hi David, Hans Challenge got me in deeper than just finding the 4007 digit cpap3. your 4260 digit BLS provable CPAP3 caught my attention. Based on its...
PS: Jens kindly informed that my idea was long-ago implemented by Tony Forbes: http://www.ltkz.demon.co.uk/ktuplets.htm#largest4 ... That's 2^n+/-1 based,...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
