Syracuse Conjecture Quadrature (SCQ)

After circa 2300 years (Circle Quadrature, Archimedes, Syracuse 287 - 212 BC) the history of mathematics repeats itself in a different problem. This paper presents an original research on the Syracuse Conjecture (3x+1 problem). It proposes a theoretical development aimed at solving the conjecture through a systematic approach. Theorem 2n+1 subdivides the set of odd numbers into seven subsets which have different behaviors applying algorithm of Collatz. It allows to replace the Collatz’s cycles with the cycles of links, transforming oscillating sequences into monotone decreasing sequences. Theorem of Independence allows to manage the cycles of links to our liking to reach very high main horizons and, when we decide, go back to lower horizons. In this article it’s proved that Collatz conjecture is not fully demonstrable. In fact, if we consider the banal link n < 2n, there are eight cycles which connect each other in an endless of possible sequences and related links. It is a new type of Squaring of the Circle or Algebraic Quadrature, but its statement is confirmed. In other words: BIG CRUNCH (go back to 1) is always possible, but BIG BANG (to move on) has no End.