A simple application to visualize solving-loop of Collatz Conjectur, takes two arguments N, C.
Where N represents base-positive-number, and C represents looping-count(if it's not provided, application will loop infinitely)
The 3x + 1 problem is most simply stated in terms of the Collatz function C(x) defined on integers as multiply by three and add one for odd integers and divide by two for even integers. That is,
C(x) = {
(if x is ODD) 3x + 1
(if x is EVEN) x / 2
}
The 3x + 1 problem (or Collatz problem) is to prove that starting from any positive integer,
some iterate of this function takes the value 1. The problem other names: it has also been called Kakutanis problem, the Syracuse problem, and UlamÕs problem.
For more information refer to References header
- Main source of inspiration - Veritasium - The Simplest Math Problem No One Can Solve - Collatz Conjecture
- Lagarias, J. C. (2003). The 3x+ 1 problem: An annotated bibliography (1963Ð1999). The ultimate challenge: the 3x, 1, 267-341
- Lagarias, J. C. (2006). The 3x+ 1 problem: An annotated bibliography, II (2000-2009). arXiv preprint math/0608208
- Tao, T (2020). The Notorious Collatz Conjecture