The Last Poster Wins - Continued

[Amelium]

The winner is whoever names the number with

…the longest path that reaches 1 following the Collatz Conjecture. This is an attempt to improve on the last post, where an approach was quite quickly found to maximize the number (just a high power of 2). This time we’ve got a challenge which I think is more interesting and hopefully not as easy to exploit. For the unaware, the Collatz Conjecture works as follows: def collatz(n): while n != 1: if n % 2 == 0: # If even, divide by 2 n /= 2 else: # If odd, multiply by …