A Visualization of the Collatz Conjecture
Author: tonagaiExecutions: 99365
※ This library was created by a member. This site is not responsible for its content.
When n = 931386509544713451, it takes 2,283 steps to reach 1; when n = 5977996304343501855, it takes 2,389 steps to finally reach 1.
- Related links
No customer feedback for this calculation yet.
If n is even, divide n by 2
if n is odd, multiply n by 3 and add 1
This illustrates the Collatz conjecture, which states that repeating this process results in 1. For n = 27, it takes 111 iterations to reach 1.
It is said that a reward of 100 million yen will be awarded to anyone who can prove it.