Terminator classification and singularity in the pn+1 family of maps

Abstract

Summary of Research This paper presents a complete algebraic classification of "exact terminators" within the $pn+1$ family of maps, a generalization of the famous Collatz conjecture ($p=3$). An exact terminator is defined as an orbit value that collapses to 1 in a single contraction step. Key Results Algebraic Classification: We prove that exact terminators exist for an odd prime $p$ if and only if the multiplicative order of 2 modulo $p$, denoted $\mathrm{ord}_p(2)$, is even. This provides a sharp algebraic boundary: primes like $7, 23, 31$ admit no terminators, while $p=3$ achieves the maximal possible density of $1/2$. Singularity of $p=3$: By combining this algebraic result with standard equidistribution heuristics, we demonstrate that $p=3$ is the unique member of the family satisfying both maximal terminator density and the negative drift condition ($p/4 < 1$). This offers a rigorous structural explanation for why the $3n+1$ map is expected to converge universally while maps with $p \geq 5$ are not. Novel Frameworks: The proofs utilize two new analytical tools: A base-4 analysis that links growth chain lengths directly to 2-adic valuations. An $m$-coordinate system ($n = 3m \pm 1$) that decomposes the map into pure growth ($\times 3/2$) and explicit contraction phases. Significance Unlike previous heuristic approaches, all classification results in this paper are unconditional (rigorously proved). The work bridges classical number theory (multiplicative orders, valuations) with discrete dynamical systems, offering a new lens through which to view the divergence/convergence dichotomy in $pn+1$ maps. The gap between these results and the full Collatz conjecture is explicitly identified as the problem of equidistribution of valuations along individual orbits. Keywords: Collatz conjecture, $pn+1$ maps, exact terminators, multiplicative order, 2-adic valuation, discrete dynamics, number theory.