There will be soon a new subproject attacking an collatz issue integrated in yoyo@home
log in

Advanced search

Message boards : Science : There will be soon a new subproject attacking an collatz issue integrated in yoyo@home

Author Message
Matt Kowal
Avatar
Send message
Joined: 21 Mar 14
Posts: 34
Credit: 675,050,450
RAC: 427,459
Message 24184 - Posted: 14 Aug 2017, 18:00:26 UTC

You have to enable this project in your settings and allow test applications. Linux 64 bit will be the first version.
http://www.rechenkraft.net/yoyo/all_news.php
____________

Matt Kowal
Avatar
Send message
Joined: 21 Mar 14
Posts: 34
Credit: 675,050,450
RAC: 427,459
Message 24185 - Posted: 15 Aug 2017, 14:32:28 UTC - in response to Message 24184.

The application for Nontrivial Collatz Cycle is now available for 64 bit Linux @x86 and @ARM.

Nontrivial Collatz Cycle wants to prove that there are no Collatz Cycles with length < 17*109 other than 1 - 4 - 2. Therefore it searches for Path Records with start numbers up tp 1021.
____________

Profile Slicker
Volunteer moderator
Project administrator
Project developer
Project tester
Project scientist
Avatar
Send message
Joined: 11 Jun 09
Posts: 2525
Credit: 740,580,099
RAC: 1
Message 24189 - Posted: 16 Aug 2017, 17:45:47 UTC

Very nice. Are there Windows or OS X versions planned?

Matt Kowal
Avatar
Send message
Joined: 21 Mar 14
Posts: 34
Credit: 675,050,450
RAC: 427,459
Message 24199 - Posted: 18 Aug 2017, 16:31:47 UTC - in response to Message 24189.

Very nice. Are there Windows or OS X versions planned?


A Windows application is now available: http://www.rechenkraft.net/yoyo/apps.php
____________

Matt Kowal
Avatar
Send message
Joined: 21 Mar 14
Posts: 34
Credit: 675,050,450
RAC: 427,459
Message 24298 - Posted: 25 Sep 2017, 0:06:22 UTC
Last modified: 25 Sep 2017, 0:06:39 UTC

After less than one and a half months (14 August to 23 September), we were able to successfully complete our search project:

We have found all the smaller path records (http://ericr.nl/wondrous/pathrecs.html) as well as all starting numbers <260, whose maximum > 2 * 1016 * starting number (only such numbers are given as candidates) which were found by other persons (mainly Tomas Olivera e Silva and Eric Roosendaal); and thus validate our approach in the opposite direction.
We have found 4 new path records and have been able to prove that all starting numbers <87 * 260 (in particular also all <1020) land at 1 and pass into the trivial cycle.
Thus, we have also shown that a non-trivial cycle must consist of more than 17 billion sequence members

____________


Post to thread

Message boards : Science : There will be soon a new subproject attacking an collatz issue integrated in yoyo@home


Main page · Your account · Message boards


Copyright © 2018 Jon Sonntag; All rights reserved.