Realisation of Collatz conjecture (or 3n+1 problem) written on go.
-
Updated
Aug 24, 2021 - Go
Realisation of Collatz conjecture (or 3n+1 problem) written on go.
Projet NSI | Conjecture de Syracuse
Golang implementation of 3N+1 problem
Multi threaded realisation of Syracuse conjecture/Collatz conjecture/3n + 1 problem
An algorithm to compute the collatz sequence for numbers.
The goal of this personal project was to develop a script that will attempt to solve the Collatz conjecture, also known as the Syracuse problem. This personal challenge was developed, tested and optimized in less than 2 hours.
Calculate and display the Collatz sequence (3n+1 problem) for very large integers. Sequence is handled as vector in memory.
Graphiques sur la suite de Syracuse
Calculate and display the Collatz sequence (3n+1 problem) for very large integers by handling the sequence via a file on disk
Add a description, image, and links to the syracuse-problem topic page so that developers can more easily learn about it.
To associate your repository with the syracuse-problem topic, visit your repo's landing page and select "manage topics."