The Tower Partition of the Positive Integers. a Structural Framework for the Collatz Conjecture, Even Perfect Numbers and Prime Factorization.
Year: 2026
Type: article
Abstract: We introduce and develop the tower partition of the positive integers which is a complete and canonical decomposition of every positive integer into infinite sets we call towers. The construction proceeds entirely from first principles requiring no prior knowledge of the Collatz conjecture, no multiplication, no division and no addition beyond the elementary notion of a successor. We prove that the partition is complete in the precise sense that every positive integer belongs to exactly one tower determined uniquely by the largest odd factor of , equivalently described through the -adic valuation . The tower partition arranges itself naturally into a two-dimensional grid in which towers form the rows and depths form the columns. We prove that every column at depth is an arithmetic progression with the first term and common difference . We prove that the common difference of the column at depth is precisely the Tower entry at depth establishing that Tower simultaneously provides the first term of every column and the arithmetic tool by which every column converges upward toward Tower . From any element at depth in Tower , subtracting the column’s common difference repeatedly reaches Tower entry in exactly steps. We call this upward convergence and together with the Collatz halving operation which moves leftward within each row, it establishes that the grid possesses bidirectional convergence toward Tower in both of its dimensions. We develop a factorized representation of the grid in which every entry is expressed in its prime factorization form. This representation reveals that the prime is the unique prime occupying Tower , that every other prime occupies the leftmost column of the grid as a tower head at depth zero and the integer , being the unique positive integer with no prime factorization and the unique element that is neither prime nor composite, occupies the origin of the entire grid at Tower depth zero. The factorized grid is the most explicit simultaneous representation of the Fundamental Theorem of Arithmetic and the tower partition. We prove that for any positive integer where , the complete factor set partitions by tower head into equal-length tower segments, one for each odd divisor of , each of length . The total factor count satisfies which is the classical divisor count formula expressed entirely through the tower partition. We further prove that the tower partition of the positive integers is simultaneously the tower partition of the factor sets of all positive integers: every factor of every integer has a unique tower address and the Collatz halving operation navigates through tower factor structures exactly, visiting the complete Tower factor segment of in descending order during the descent from depth to tower head . We establish a canonical three-way partition that holds for every positive integer. For any positive integer , the union of and the Collatz trajectory partitions into three disjoint groups. The group consists of integers that are simultaneously factors of and members of its Collatz trajectory. The group consists of factors not visited by the trajectory. The group consists of trajectory members that are not factors. We prove that the members of both and when grouped by tower head, form complete tower segments placing the three-way partition on the same structural footing as the factor organization theorem. All results are verified computationally for all positive integers from to with zero exceptions. We uncover a deep structural connection between the tower partition and even perfect numbers. Every even perfect number where is a Mersenne prime, has its factor set partitioned into exactly two equal tower segments of length : the Tower segment and the Mersenne prime tower segment . This is a direct consequence of the factor organization theorem and the Euclid-Euler theorem. We prove that a positive odd integer is a Mersenne prime if and only if it sits exactly below a Tower entry in the grid giving a new structural characterization of Mersenne primes through the tower partition. We further show that every even perfect number except equals the sum of consecutive odd cubes beginning from and that the odd numbers forming each such sum are precisely the first consecutive tower heads reading downward from Tower in the left column of the grid. These results connect two of the oldest problems in number theory through the structure of the tower partition. We make no claim regarding the infinitude of even perfect numbers or Mersenne primes as this question remains open. We prove that the Collatz rule for odd is not an external postulate but the unique rule forced by the tower structure. For every positive odd integer appearing at any non-initial position in any Collatz sequence, its immediate predecessor is always exactly , the tower parent of within . This makes the Collatz transition equal to which is a structural identity admitting no exceptions and derivable from the tower structure alone. The rule is what the tower structure looks like from an arithmetic perspective that does not yet see the towers. We further observe that the step always converts an odd tower head carrying odd prime structure into an even number carrying the prime and that halving operation removes factors of until the next odd tower head is reached. The Collatz conjecture reframed through our structure asks whether this navigation of factor sets always visits the factor through Tower . We prove that , the tower whose elements are and all positive integer powers of , is the unique absorbing tower in the Collatz dynamical system. The integer is the unique positive odd integer satisfying the self-return property . For every positive odd integer , the transition exits so no other tower retains the trajectory once its head is reached. The Collatz conjecture is therefore precisely equivalent to the assertion that every Collatz trajectory eventually enters . We identify a structural connection between the open question and a deep result in analytic number theory. The powers of occupy Tower which is the topmost row of the grid. The powers of being odd occupy the left column as tower heads. These two sequences share exactly one position in the entire grid, the origin point where and diverge from that origin in perpendicular directions never meeting again. The product formula for any nontrivial Collatz cycle demands an exact relationship between powers of and powers of that the grid shows to be geometrically impossible after the origin. The quantitative version of this divergence is Baker’s theorem on linear forms in logarithms and the grid provides the structural picture that Baker’s theorem makes precise. This paper establishes its results with complete rigor and states its limitations with complete honesty. The tower partition does not prove the Collatz conjecture. It proves that the rule is structurally forced, that the factor sets of all integers are simultaneously organized by the tower structure, that even perfect numbers and Mersenne primes have a precise structural home within the grid, that Tower is the unique structural attractor of the Collatz dynamics and that the open question can be stated with a precision not previously available. The single remaining question is identified exactly: why must every Collatz trajectory eventually enter the absorbing tower? This paper provides the structural language in which that question must ultimately be answered.
Author: Mututu, Christoper Muoki
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7222656598
FWCI:
Cites:
Cited by:
Related to: