![]() |
![]() |
#166 | |
"Garambois Jean-Luc"
Oct 2011
France
5·7·23 Posts |
![]() Quote:
Yes, I also reported this error here : https://www.mersenneforum.org/showth...t=19737&page=3 And Karsten Bonath here : https://www.mersenneforum.org/showth...=23612&page=10 Hopefully someone can fix it ! |
|
![]() |
![]() |
![]() |
#167 |
"Garambois Jean-Luc"
Oct 2011
France
5×7×23 Posts |
![]()
OK, page updated.
Thank you to all. There are indeed a few more colors on the page ! My own calculations : 3^208-214-222-224 up to 120 digits. That's right, the project goal is to search these sequences to 120 digits. Ideally, all cells should be green. But it is not physically possible to push the calculations so far in a reasonable time. 120 digits is a good compromise. I noticed that LaurV is pushing the calculations a lot further ! Congratulations ! ![]() It is only for base 2 that we can have green cells for all powers ! What would be extraordinary would be to find an aliquot sequence starting on a power of 2 and that would be Open-End ! You've all noticed that powers of 2 go up to 500. The calculations become very long. I will continue these calculations to turn all the cells green. Then, I think it will be very interesting to extend the powers beyond 500. If someone wants to calculate the aliquot sequences that start with 2^501, 2^502 or more, he can already book them. We are sure that these aliquot sequences will go down to a prime number, because from the first iteration, we must obtain odd numbers. EXCEPT if further on, we had to have a big surprise and if we had to find an even term during the calculations, and then if we had to have terms with a driver ! ![]() |
![]() |
![]() |
![]() |
#168 |
"Rich"
Aug 2002
Benicia, California
27078 Posts |
![]() |
![]() |
![]() |
![]() |
#169 |
"Garambois Jean-Luc"
Oct 2011
France
5×7×23 Posts |
![]()
OK, page updated.
Thank you to all. My own calculations : 3^220-226-230 up to 120 digits. The next update will be done on the weekend of February 23rd and 24th. |
![]() |
![]() |
![]() |
#170 |
"Rich"
Aug 2002
Benicia, California
3·17·29 Posts |
![]()
Reserving 439^18
|
![]() |
![]() |
![]() |
#171 |
"Garambois Jean-Luc"
Oct 2011
France
11001001012 Posts |
![]()
OK, page updated.
Thank you to all. My own calculations : 2^500 finished on a P29. The calculations for the powers of 2 are very long ! |
![]() |
![]() |
![]() |
#172 |
"Curtis"
Feb 2005
Riverside, CA
10100100111002 Posts |
![]()
Taking 13^18 and 13^20.
|
![]() |
![]() |
![]() |
#173 |
"Curtis"
Feb 2005
Riverside, CA
122348 Posts |
![]()
.. that was quick.
Unreserving 13^18. The C120 cofactor has been ECMed to t35, nearly enough. I have a new appreciation for the power of 2^3*3*5 to rapidly drive a sequence. |
![]() |
![]() |
![]() |
#174 |
"Garambois Jean-Luc"
Oct 2011
France
5×7×23 Posts |
![]()
OK, page updated.
Thank you to all. My own calculations : 2^496 finished on a P146 !!! |
![]() |
![]() |
![]() |
#175 |
"Garambois Jean-Luc"
Oct 2011
France
5×7×23 Posts |
![]()
OK, page updated.
Thank you to all. My own calculations : 2^492 not yet finished despite 8 threads constantly calculating on it ! |
![]() |
![]() |
![]() |
#176 |
"Curtis"
Feb 2005
Riverside, CA
22·1,319 Posts |
![]()
13^12 released.
162 digits, C160 that withstood 2t45 ECM. 2^3*3*5 driver, thing went straight up after a nice downdriver run. Taking 13^22. Last fiddled with by VBCurtis on 2019-03-17 at 22:43 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Broken aliquot sequences | fivemack | FactorDB | 46 | 2021-02-21 10:46 |
Broken aliquot sequences | schickel | FactorDB | 18 | 2013-06-12 16:09 |
A new theorem about aliquot sequences | garambois | Aliquot Sequences | 34 | 2012-06-10 21:53 |
poaching aliquot sequences... | Andi47 | FactorDB | 21 | 2011-12-29 21:11 |
New article on aliquot sequences | schickel | mersennewiki | 0 | 2008-12-30 07:07 |