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!)

Highly optimized rust program to find the number with the largest steps from 1 to n following the collatz conjecture

Simple Calculator for collatz sequences for arbitrary large integers

A graphical simulation of the Collatz Conjecture. Visualize the sequence evolution in real time with adjustable speed and export options.

Graphic representations of Collatz sequences

コラッツ数列生成器

Interview question relating to Collatz sequences

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.

Calculate and display the Collatz sequence (3n+1 problem) for very large integers. Sequence is handled as vector in memory.

3n+1 differently

Collatz algorithm written in rust, compiled to WASM and used in a webproject. Chartjs used for graphics.

コラッツ予想に関する何か

Arc diagram visualization of the parity Collatz function from the famous conjecture.

A code challenge to create a sequence of numbers based on the Collatz Conjecture.

The Generalized Collatz Conjecture

A basic Python 3 script to make a line graph by calculating the Collatz Conjecture from any given integer.

Efficiently calculate the longest total stopping times of Collatz sequences.

Generate a Collatz Sequence from a defined starting term, for example 3 > 10 > 5 > 16 > 8 > 4 > 2 > 1