We will proof that the 3x+1 conjecture is true, using modular arithmetic and a new approach based on an ancient symbol THE ENNEAGRAMMA. We will show that for every integer n, n ≡ 1 (mod 2) if and only if 3n+1 ≡ 4 (mod 6). With the help of directed graphs, flow and block diagrams we will find 1 equation which, applying the 2 conditions, links all the odd numbers and consequently the positive integers to the powers of 2. We will find the analytical equation of the function. We will show how "numerical gravity" arises from the deterministic divisibility that the combinations of integers allow. We will go up the Collatz graph represented by the inverse function which forms a tree with the exception of the cycle 1-4-2-1... We will show how all positive integers are present in the tree, that is connected to the number 1, making extensive use of graphs, tables and colors to represent the beauty of mathematics. We will follow the exact chronology of the insights. Careful observation of the numbers will return an elementary (-a)rithmetic (double logical negation equals affirmation). We will not omit steps that are obvious, since these are the substrate on which the approach is based. We hope you can appreciate the extreme simplicity, harmony and rhythm that the numbers manifest.