SOME PROPERTIES OF THE 3 n 1 FUNCTION
Ranan B. Banerji · Cybernetics & Systems · 1996
The so called 3n 1 function takes odd integers n to 3n 1 and even integers to n 2 It appears that repeated applications of this function invariably reach 1 No proof of this is known The present paper deals with some properties of this function especially with respect to the way its behavior is reflected in binary and ternary representations of integers