Give Scratch Cat a number. If it's odd, they will multiply it by 3, then add 1. If it's even, they divide it by 2. The Collatz conjecture says that no matter the input number, the answer will eventually lead to a 1, or in a 4, 2, 1 loop. Why 4,2, 1? It's because of the rules, 4 is even, devide by 2, that's 2, divide 2 by 2 because it's also even, that's 1, but 1 is odd, so multiply by 3, that's 3, then add 1, that's 4, then the loop continues. Also works for '#e+#' for example 5e+10.
"The Collatz conjecture is one of the most famous unsolved problems in mathematics. The conjecture asks whether repeating two simple arithmetic operations will eventually transform every positive integer into 1. It concerns sequences of integers in which 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. If the previous term is odd, the next term is 3 times the previous term plus 1. The conjecture is that these sequences always reach 1, no matter which positive integer is chosen to start the sequence. It is named after mathematician Lothar Collatz, who introduced the idea in 1937, two years after receiving his doctorate. It is also known as the 3n + 1 problem, the 3n + 1 conjecture, the Ulam conjecture (after Stanisław Ulam), Kakutani's problem (after Shizuo Kakutani), the Thwaites conjecture (after Sir Bryan Thwaites), Hasse's algorithm (after Helmut Hasse), or the Syracuse problem. The sequence of numbers involved is sometimes referred to as the hailstone sequence, hailstone numbers or hailstone numerals (because the values are usually subject to multiple descents and ascents like hailstones in a cloud), or as wondrous numbers." https://en.wikipedia.org/wiki/Collatz_conjecture
