The Collatz conjecture, also known as the 3n + 1 conjecture, is a famous unsolved problem in mathematics that deals with sequences defined in a particular way. The conjecture can be described as follows: 1. Take any positive integer \( n \). 2. If \( n \) is even, divide it by 2. 3. If \( n \) is odd, multiply it by 3 and add 1.
Given stuff like arxiv.org/pdf/2107.12475.pdf on Erdős' conjecture on powers of 2, it feels like this one will be somewhere close to computer science/Halting problem issues than number theory. Who knows. This is suggested e.g. at The Busy Beaver Competition: a historical survey by Pascal Michel.
New to topics? Read the docs here!