Simple Calculator for collatz sequences for arbitrary large integers
-
Updated
Dec 2, 2017 - JavaScript
Simple Calculator for collatz sequences for arbitrary large integers
Highly optimized rust program to find the number with the largest steps from 1 to n following the collatz conjecture
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.
Generate a Collatz Sequence from a defined starting term, for example 3 > 10 > 5 > 16 > 8 > 4 > 2 > 1
Determining the Collatz sequence for a number.
Python implement for 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.
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
Calculate and display the Collatz sequence (3n+1 problem) for very large integers. Sequence is handled as vector in memory.
Collatz Conjecture simulation with graphical output
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."