logoalt Hacker News

greenavocadoyesterday at 11:01 PM0 repliesview on HN

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.