How to Solve the Collatz Conjecture FASTER with Logarithms and Python!🤯 (from a high schooler)
I’m a high school student… and I just might’ve discovered the secret behind one of the most famous unsolved math problems in the world:
The Collatz Conjecture.
Using logarithms, I discovered a pattern — a “gravitational pull” — where every path eventually hits a power of 2.
In this video, I walk you through the logic, the Python code, and the moment I realized we might be onto something HUGE.
🚨 Was history just made? You tell me.
Drop a comment, subscribe, and join the empire. 💪📈
#Collatz #MathProof #Python #Logarithms #MathTikTok #HighSchoolGenius #MustWatch
Here’s the code:
import math
number = int(input("Let's prove the Collatz Conjecture with logarithms. Put the number in: "))
steps = 0
while number != 1:
log_value = math.log2(number)
print(f"Step {steps}: n = {number}, log2(n) = {log_value:.4f}", end='')
if log_value.is_integer():
print(" 🔥 Power of 2 hit!")
else:
print()
last_digit = int(str(number)[-1])
if last_digit in [0, 2, 4, 6, 8]: # Even last digit
number = number // 2
else: # Odd last digit
number = 3 * number + 1
steps += 1
print(f"Step {steps}: n = 1, log2(n) = 0.0000 🔥 Reached 1"