Author Message

Sergei Chernykh



Project developer

Project administratorProject developer Send message

Joined: 5 Jan 17

Posts: 445

Credit: 72,451,573

RAC: 0

Joined: 5 Jan 17Posts: 445Credit: 72,451,573RAC: 0 Message 462 - Posted: 8 Jun 2017, 10:19:57 UTC Hello all crunchers!



The search for amicable numbers up to 2^64 is almost done: all previously known numbers are already covered by the search, zero numbers were missed which is very good and gives me confidence. It's extremely unlikely to find anything in the remaining WUs, but they need to be processed to complete the search.



The next steps will be:



1) Double check a small portion of the search space to increase confidence that nothing is missed. It will be a separate application so everyone will have choice whether to move to the next search range or help verify the current range.

2) Start the search for amicable numbers up to 10^20. It will be a separate application as well and it will become the default application as soon as the current search runs out of WUs. CPU version is ready, GPU version is work in progress and hopefully will be finished before the start of the search. Reply Quote ID: 462 · Rating: 0 · rate:

Speedy

Send message

Joined: 6 Jun 17

Posts: 31

Credit: 40,856,855

RAC: 31,173

Joined: 6 Jun 17Posts: 31Credit: 40,856,855RAC: 31,173 Message 582 - Posted: 19 Jul 2017, 9:03:05 UTC I am curious to know if anyone knows how many more tasks there are for 2_64? Before it is finished Reply Quote ID: 582 · Rating: 0 · rate: