Click on green flag. The number of steps for each integer N (N = 2 – 462) is computed and stored in a list (watch the N slider) and then the list is graphed. For the positive integers from 2 through 462, the number of steps it take for each integer to reach 1 are stored in a list and then plotted: integers on the x-axis, number of steps on the y-axis. The plot shows two wavy patterns that intersect. This pattern offers no clue as to the proof of the conjecture (see Notes and Credits). This is the the third of three Collatz Projects. The other two projects can be viewed here: The Collatz Conjecture - Introduction https://scratch.mit.edu/projects/15709130/ Collatz Conjecture - Graph of N v. Orbit https://scratch.mit.edu/projects/118065441/
In mathematics, a conjecture is a statement believed to be true but is unproven but also not found to be false by counterexample. Collatz Conjecture For every positive integer N: If N is even, divide N by 2, If N is odd, multiply N by 3 and add 1 Every N eventually reaches 1.
