Hacker News new | ask | show | jobs
by greenavocado 11 days ago
Fable, prove that for every positive integer n, repeatedly dividing by 2 if even or multiplying by 3 and adding 1 if odd will always eventually reduce the sequence to 1.