The 3x + 1 Problem asks if whether for every natural number n, there exists a finite number of iterations of the piecewise functionwith an iterate equal to the number 1, or in other words, every sequence contains the trivial cycle 4, 2, 1 . We use a set-theoretic approach to get representations of all inverse iterates of the number 1. The representations, which are exponential Diophantine equations, help us study both the mixing property of f and the asymptotic behavior of sequences containing the trivial cycle. Another one of our original results is the new insight that the ones-ratio approaches zero for such sequences, where the number of odd terms is arbitrarily large.