mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Aliquot Sequences

Reply
 
Thread Tools
Old 2020-06-12, 18:44   #243
yoyo
 
yoyo's Avatar
 
Oct 2006
Berlin, Germany

22×3×72 Posts
Default

One of my goals is to run all sequences below 1e5 to a C149.
yoyo is offline   Reply With Quote
Old 2020-07-27, 12:00   #244
Drdmitry
 
Drdmitry's Avatar
 
Nov 2011

2×32×13 Posts
Default

There are only two aliquot sequences below 100000 which never reached 145 digits:
38052 (reserved by Clifford, last update 21.07.2019)
46758 (jacobs and Richard Guy, 25.12.2017)
Both of them look abandoned.

On top of those, there is only one aliquot sequence (95700, vacant) which reach 146 digits and 17 other sequences reach 147 digits.

I think it is possible to reach the milestone of 150 digits for all sequences below 10e5 in the near future.

Last fiddled with by Drdmitry on 2020-07-27 at 12:04
Drdmitry is offline   Reply With Quote
Old 2020-07-27, 17:41   #245
yoyo
 
yoyo's Avatar
 
Oct 2006
Berlin, Germany

24C16 Posts
Default

Quote:
Originally Posted by Drdmitry View Post
There are only two aliquot sequences below 100000 which never reached 145 digits:
38052 (reserved by Clifford, last update 21.07.2019)
46758 (jacobs and Richard Guy, 25.12.2017)
Both of them look abandoned.
I'll take both.
yoyo is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Project ends at 79.3 M davieddy Lounge 0 2013-01-09 16:56
gmp-ecm records page question yqiang GMP-ECM 6 2007-05-18 12:23
Running LL test from both ends of the sequence? MS63 Math 40 2005-12-15 09:23
is there only one Mersenne prime that ends in 3? ixfd64 Math 18 2005-12-08 02:40
Records in January wblipp ElevenSmooth 10 2004-03-22 01:26

All times are UTC. The time now is 14:03.

Sun Oct 25 14:03:28 UTC 2020 up 45 days, 11:14, 0 users, load averages: 1.66, 1.73, 1.66

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