mersenneforum.org  

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

Reply
 
Thread Tools
Old 2009-09-25, 05:00   #100
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default

Congrats to David (c4) on the new record Mersenne cofactor:

(2^17683-1)/(234000819833373807217*62265855698776681155719328257)
(5274 digits)

Finding a 29-digit factor 62265855698776681155719328257 of a 5303-digit number is a major factoring achievement!
Kosmaj is offline   Reply With Quote
Old 2009-10-19, 21:00   #101
Harvey563
 
Harvey563's Avatar
 
Apr 2004

3×61 Posts
Cool new GW

103444*27^103444-1 Generalized Woodall, ninth largest known.


Steven Harvey
Harvey563 is offline   Reply With Quote
Old 2009-12-10, 23:19   #102
em99010pepe
 
em99010pepe's Avatar
 
Sep 2004

2·5·283 Posts
Default

27*2^1902689-1

Last fiddled with by Kosmaj on 2009-12-11 at 01:08 Reason: "-1" added
em99010pepe is offline   Reply With Quote
Old 2009-12-11, 00:01   #103
Flatlander
I quite division it
 
Flatlander's Avatar
 
"Chris"
Feb 2005
England

31×67 Posts
Default

Good ol' k=27 strikes again.
27*2^627794-1 was my first top-5000 prime, with an entrance rank of 198 that I still haven't beaten.
Flatlander is offline   Reply With Quote
Old 2009-12-11, 21:48   #104
Vato
 
Jan 2009

22·5 Posts
Default

563528*13^563528-1 is now the biggest GW by far and breaks the base 13 duck at last.

Last fiddled with by Vato on 2009-12-11 at 21:49 Reason: removed space
Vato is offline   Reply With Quote
Old 2010-10-01, 18:37   #105
lsoule
 
lsoule's Avatar
 
Nov 2004
California

23·3·71 Posts
Default

Near-repdigits:
99999993*10^180207-1 180215 L184 Oct 2010 (Near-repdigit)
99999993*10^106947-1 106955 L184 Oct 2010 (Near-repdigit)

The first one is the second largest and missed being the largest by about 30 digits. The second is the 10th largest Near-repdigit.
lsoule is offline   Reply With Quote
Old 2010-10-02, 09:01   #106
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2·1,811 Posts
Default

Larry, congrats on nice primes. I hope you reclaim the NRD record soon.

I stopped all my "side" project a while ago. I found my last NRD more than 3 years ago ...
Kosmaj is offline   Reply With Quote
Old 2010-10-25, 13:03   #107
Merfighters
 
Merfighters's Avatar
 
Mar 2010
On front of my laptop

7×17 Posts
Smile

New record AP4 by Broadhurst - 9,000 digits longer than the previous one!
http://primes.utm.edu/primes/page.php?id=95651

Last fiddled with by Merfighters on 2010-10-25 at 13:04
Merfighters is offline   Reply With Quote
Old 2011-01-14, 07:07   #108
Cruelty
 
Cruelty's Avatar
 
May 2005

65816 Posts
Default

2^1667321-2^833661+1 (501914 digits) Gaussian Mersenne norm 38
Cruelty is offline   Reply With Quote
Old 2011-01-17, 04:28   #109
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default

Cruelty

Congrats on a nice prime!
Can you share exe times, hardware details with us.

Thanks.
Kosmaj is offline   Reply With Quote
Old 2011-01-20, 13:10   #110
Cruelty
 
Cruelty's Avatar
 
May 2005

23×7×29 Posts
Default

Thanks!
The search runs on single core of C2Q @ 3GHz. Single test using LLR takes ~4800 sec.
Cruelty is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Mersenne Primes p which are in a set of twin primes is finite? carpetpool Miscellaneous Math 3 2017-08-10 13:47
Distribution of Mersenne primes before and after couples of primes found emily Math 34 2017-07-16 18:44
Conjecture about Mersenne primes and non-primes v2 Mickey1 Miscellaneous Math 1 2013-05-30 12:32
A conjecture about Mersenne primes and non-primes Unregistered Information & Answers 0 2011-01-31 15:41
possible primes (real primes & poss.prime products) troels munkner Miscellaneous Math 4 2006-06-02 08:35

All times are UTC. The time now is 11:49.


Sat Jul 17 11:49:36 UTC 2021 up 50 days, 9:36, 1 user, load averages: 1.67, 1.42, 1.32

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.