The problem was posed as a while loop, and the question was, does the loop terminate for arbitrary n>0, so it seemed very tractable:
given: n > 0.
while n != 1:
if n is odd:
n = 3n + 1
else:
n = n/2
It was a tease. I tried a couple of different ways to prove it, but of course nothing worked. Then I tried to find a counter-example. The numbers get pretty big, in some cases, because applying n = 3n + 1
several times in a row will blow "n" up, despite the intervening n = n/2. This was before arbitrary-precision arithmetic was a thing, so the only tool I knew that could do this was the Unix "dc". I think I was able to get up to n=10K or 50K on our campus VAX.That was about 30 years ago. I still remember it fondly.