by Seth Mottaghinejad Let's review the Collatz conjecture, which says that given a positive integer n, the following recursive algorithm will always terminate: if n is 1, stop, otherwise recurse on the following if n is even, then divide it by 2 if n is odd, then multiply it by 3 and add 1 In our last post, we...