Python library for the analysis of the Collatz problem, providing notebooks, scripts and common modules.
-
Updated
May 16, 2025 - Python
Python library for the analysis of the Collatz problem, providing notebooks, scripts and common modules.
The Collatz Conjecture is (not) the simplest math problem I am about to code. (my first mini project made in almost a single day!)
The Collatz Conjecture | 3N + 1
3n+1 differently
Program to calculate the Collatz sequence for very large integers. Using crate BigInt.
Determining the Collatz sequence for a number.
A graphic that visualize Collatz sequence. The Collatz conjecture is a conjecture in mathematics that concerns sequences defined as follows: start with any positive integer n. Then each term is obtained from the previous term as follows: if the previous term is even, the next term is one half of the previous term.
Arc diagram visualization of the parity Collatz function from the famous conjecture.
Just a minimal tester for collatz conjecture
A visualization of the Collatz Conjecture for any initial positive integer, n, checking until the sequence eventually narrows down to 1.
Program to calculate the Collatz sequence for very large integers. Using crate BigInt.
Collatz Conjecture Solver & Calculator
Graphic representations of Collatz sequences
A basic Python 3 script to make a line graph by calculating the Collatz Conjecture from any given integer.
Collatz Conjecture simulation with graphical output
Highly optimized rust program to find the number with the largest steps from 1 to n following the collatz conjecture
Efficiently calculate the longest total stopping times of Collatz sequences.
Interview question relating to Collatz sequences
Simple Calculator for collatz sequences for arbitrary large integers
Add a description, image, and links to the collatz-sequences topic page so that developers can more easily learn about it.
To associate your repository with the collatz-sequences topic, visit your repo's landing page and select "manage topics."