Search arXiv⌕ Search

arXiv · 2611.10018

Nonconstant Congruence Speeds of Integer Tetration in Non-Squarefree Radices

Abstract

We further develop the theory of congruence speed for integer tetration in non-squarefree numeral systems, building on Appendix B of [M. Ripà and G. Di Pietro (2026), A compact notation for peculiar properties characterizing integer tetration, Notes on Number Theory and Discrete Mathematics, 32(3), 477-496]. For bases coprime to the radix, we establish an eventual floor-difference representation and determine the exact spectrum of attainable least periods. We construct explicit arithmetic progressions containing infinitely many prime bases with nonconstant congruence speed for every non-squarefree radix, thereby proving the coprime-infinitude conjecture posed in Appendix B. We also derive a uniform quadratic bound for the least coprime base with nonconstant congruence speed and establish exact natural densities of nonstabilizing bases, both among integers coprime to the radix and among those not divisible by its radical, together with the corresponding relative density among primes. Finally, we give necessary and sufficient conditions for the perfect-power congruence-speed identity (Equation (2.12) of the cited paper) to hold in arbitrary radices, determine the exact least eventual period when stabilization fails, and establish a separate criterion for the boundary case of the original parameter restriction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Ripà. 2026-11-04. Nonconstant Congruence Speeds of Integer Tetration in Non-Squarefree Radices. https://arxiv.org/abs/2611.10018

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Structure of a Non-Isometric Non-Contractive Bijection of a Hereditarily Precompact Quasi-Metric Space

On a hereditarily precompact quasi-metric space, every non-contractive bijection $F$ is asymptotically an isometry along its backward orbits: for all $a$ and $\varepsilon>0$, $0\le d(Fx,Fy)-d(x,y)<\varepsilon$ for $x$ far in the past of $a$ and all $y$. Zavarzina asked whether every such bijection of a precompact space is an isometry; the author's toll spiral (arXiv:2610.13973) answered no. Each such $F$ has a register, a quasi-pseudo-metric $λ^-\le d$ for which $F$ is an isometry, with round-trip distances totally bounded on orbits; after completion, $F$ acts on each orbit as a rotation of a compact monothetic group, its rigid shadow. The defect $d-λ^-$ from $x$ to $y$ is at most the fee of $x$ (the supremum of its defects to earlier iterates) and at least the excess of $x$'s fee over $y$'s now or at any earlier time, less their round-trip register distance; the fee never decreases forward along orbits and tends to zero backward. In this sense, every such $F$ is a toll over its rigid shadow. The fees bound the defect but do not determine it: three spirals show it can depend on $y$, vanish at a distant $y$ even when $x$ has a positive fee, and be positive toward later iterates of $x$. The toll-spiral paper asked whether every such map is conjugate to a tolled extension, a fixed toll zone over an isometric shadow, possibly with infinitely many zones. If only descents are charged, the answer is no, even up to bi-Lipschitz conjugacy; on each infinite orbit, a map is such an extension over its register exactly when its ascents carry no defect. Fees may vanish at any rate, but for zone tolls (two-valued, shift-monotone, subadditive along their routes) they reach zero at a finite depth. The general results hold on quasi-pseudo-metric spaces where every sequence has a left K-Cauchy subsequence; all but the statements listed at the end are machine-checked in Lean.

math.GM↗

Prime supports and vanishing in restricted coprime representations

We study the prime supports that eliminate every representation of an even integer $N$ by two positive integers coprime to $6P$. Let $J(k)$ be the largest vanishing instance obtainable with at most $k$ factors of $P$ not dividing $N/2$. We prove $k(\log k)^2\ll J(k)\ll_\varepsilon k^{4+\varepsilon}$ for every $\varepsilon>0$. The upper bound follows by comparing a classical family of shifted-prime representations with a two-dimensional upper sieve for the loss at each additional factor. Retaining the same local density factor in both estimates yields a weighted survival criterion and positivity whenever the number of noncolliding factors above $N^θ$ is sufficiently small compared with $N^θ$, for fixed $0<θ<1/4$. An exact reduction separates a minimum prime cover into forced prime-pair contributions and a residual problem, and gives the lower bound for $J$ along powers of two. Residue occupancies characterize the extremal concentration at a first zero. Explicit discrepancy estimates show that supports with at most eleven factors cannot eliminate every representation when $N>2780460$, nor supports with at most seven noncolliding factors when $N\ge2266292$. Positivity for the complete support of primes up to $\sqrt N$ remains open.

math.GM↗

Double sums involving quotients of binomial coefficients

This paper is the third part of our detailed investigation of double sums where the inner sum is binomial but incomplete. We prove many identities for these double sums involving quotients of binomial coefficients and additional parameters. In addition, we evaluate some quadratic incomplete sums using Legendre polynomials.

math.GM↗