My attempt to solve the Collatz Conjecture: Part 1

Hey, so here is part 1 of my playful attempt to solve the Collatz Conjecture. I hope you guys have fun navigating through my process.

Here is a brief explanation of the Collatz Conjecture:

Imagine you have a starting number, let's call it n. Now, if n is even, you divide it by 2. If it's odd, you multiply it by 3 and add 1. You keep doing this over and over again with the new number you get each time.

Here's an example:

Let's start with n=6:

1. 6 is even, so divide by 2 to get 3.
2. 3 is odd, so multiply by 3 and add 1 to get 10.
3. 10 is even, so divide by 2 to get 5.
4. 5 is odd, so multiply by 3 and add 1 to get 16.
5. 16 is even, so divide by 2 to get 8.
6. 8 is even, so divide by 2 to get 4.
7. 4 is even, so divide by 2 to get 2.
8. 2 is even, so divide by 2 to get 1.

And you see, no matter what number you start with, you eventually end up at 1.

But here's the mysterious part: Nobody knows for sure if this pattern continues forever. The Collatz Conjecture says it does, but it's never been proven. Mathematicians have checked it for insanely huge numbers, and it always seems to work, but they haven't found a way to prove it's true for every single number.