2
Convergence verification of the Collatz problem
source link: https://pcbarina.fit.vutbr.cz/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Convergence verification of the Collatz problem
Convergence verification of the Collatz problem
The convergence of all numbers below 674 × 260 (≈ 269.40) has been verified. The work unit is 240 numbers. On modern GPUs, verification of one work unit takes 12 seconds on average. All source codes are available on this GitHub repository.
Progress towards verifying all numbers below 675 × 260
Lowest incomplete: 28.9371 % (work unit 707043652 × 240, all work units below are verified)
Lowest unassigned: 29.3101 % (work unit 707047563 × 240, all work units below are assigned or even verified)
Results
- Table with found path records.
Project log
- 2019–09–04 started the project
- 2020–05–07 the convergence of all numbers below 268 is verified
- 2021–12–10 the convergence of all numbers below 269 is verified
Contact
David Barina <[email protected]>
References
- Barina, D. Multiplication Algorithm Based on Collatz Function. Theory Comput Syst 64, 1331–1337 (2020). https://doi.org/10.1007/s00224-020-09986-5
- Barina, D. Convergence verification of the Collatz problem. J Supercomput 77, 2681–2688 (2021). https://doi.org/10.1007/s11227-020-03368-x
Generated: Thu, 26 Jan 2023 09:17:24 +0100
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK