A python program to run the Collatz algorithm

An interactive python based program for hailstone sequence calculation, the numbers that increase and decrease but eventually settles into a repeating pattern of the numbers 4, 2, 1. The sequence is generated by starting with any positive whole number greater than zero. Also plot graphs which reveals the true beauty of conjecture

Python programs created to study the conjecture.

The Collatz Conjecture | 3N + 1

A computational service and API for exploring and understanding the Collatz Conjecture. Continuously calculates Collatz sequences from any given number and stores results in a SQLite database for querying and analysis.

Research based around a simple yet fascinating repetitive piecewise function.

3n+1 differently

Input any Positive Integer and receives the complete sequence of The Collatz Conjecture.

Just a minimal tester for collatz conjecture

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

An implementation of the Collatz Conjecture

This is my solution or the Collatz Sequence project assignment from Chapter 3 of Automate the Boring Stuff with Python

Implementacion de la práctica desarrollada de WinDLX a lo largo del curso 23-24 de Arquitectura de Computadores (USAL)

Script provides Collatz conjecture numbers graph for a given starting number

Graphic representations of Collatz sequences

My Collatz Conjecture based PRNG. It takes advantage of the geometric Brownian motion of the sequence for a given seed to generate pseudorandom bits

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

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

The Collatz sequence, also called the 3n + 1 problem, is the simplest impossible math problem.

The Generalized Collatz Conjecture