Combinatorial properties of sparsely totient numbers
Pith reviewed 2026-05-24 17:09 UTC · model grok-4.3
The pith
A squarefree integer divides all sufficiently large sparsely totient numbers while a non-squarefree integer divides infinitely many of them.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Let N1(m) be the largest n with φ(n) ≤ m and let N1 be the set of all such N1(m) as m runs over the image of φ. For every squarefree positive integer k there exists M such that k divides every element of N1 larger than M. For every non-squarefree positive integer k there are infinitely many elements of N1 that are multiples of k. The set N1 is multiplicatively piecewise syndetic but not additively piecewise syndetic. Infinite families of elements of N1 arise from runs of consecutive primes.
What carries the argument
The maximal preimage function N1(m) under Euler's totient φ, together with the set N1 of its values at totient numbers, and its divisibility and syndeticity properties.
If this is right
- Every fixed squarefree integer eventually divides every sufficiently large element of N1.
- Every fixed non-squarefree integer divides infinitely many elements of N1.
- N1 contains infinite families constructed directly from consecutive primes.
- The multiplicative structure of N1 meets the definition of piecewise syndeticity while its additive structure does not.
- Various arithmetic and multiplicative patterns exist inside N1.
Where Pith is reading between the lines
- Large elements of N1 must therefore be divisible by the product of all small primes, since any finite product of distinct primes is squarefree.
- The contrast between squarefree and non-squarefree divisors suggests that squared prime factors appear only sparsely among the elements of N1.
- The syndeticity distinction can be tested computationally by checking gaps in the logarithmic versus linear embeddings of computed values of N1.
- Similar extremal sets defined by other arithmetic functions may exhibit parallel divisibility behavior.
Load-bearing premise
The usual multiplicative formula for the totient function in terms of prime factors together with the infinitude and distribution of primes suffice for the divisibility and syndeticity arguments.
What would settle it
An explicit squarefree integer k and an infinite sequence of arbitrarily large elements of N1 none of which is divisible by k would disprove the main divisibility claim.
read the original abstract
Let $N_1(m)=\max\{n \colon \phi(n) \leq m\}$ and $N_1 = \{N_1(m) \colon m \in \phi(\mathbb{N})\}$ where $\phi(n)$ denotes the Euler's totient function. Masser and Shiu \cite{masser} call the elements of $N_1$ as `sparsely totient numbers' and initiated the study of these numbers. In this article, we establish several results for sparsely totient numbers. First, we show that a squarefree integer divides all sufficiently large sparsely totient numbers and a non-squarefree integer divides infinitely many sparsely totient numbers. Next, we construct explicit infinite families of sparsely totient numbers and describe their relationship with the distribution of consecutive primes. We also study the sparseness of $N_1$ and prove that it is multiplicatively piecewise syndetic but not additively piecewise syndetic. Finally, we investigate arithmetic/geometric progressions and other additive and multiplicative patterns like $\{x, y, x+y\}, \{x, y, xy\}, \{x+y, xy\}$ and their generalizations in the sparsely totient numbers.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript studies the set N_1 of sparsely totient numbers, defined via N_1(m) = max{n : φ(n) ≤ m} for m in the image of Euler's totient function φ, with N_1 the corresponding image set. It proves that every squarefree positive integer divides all sufficiently large members of N_1 while certain non-squarefree integers divide infinitely many members; constructs explicit infinite families of elements of N_1 linked to gaps between consecutive primes; shows that N_1 is multiplicatively piecewise syndetic but not additively piecewise syndetic; and examines the presence of arithmetic progressions, geometric progressions, and configurations such as {x, y, x+y}, {x, y, xy}, and their generalizations inside N_1.
Significance. If the stated results hold, the paper supplies concrete structural information about the prime factors and distribution of sparsely totient numbers, extending the foundational work of Masser and Shiu. The divisibility theorems follow from the standard minimization of the product ∏(1-1/p) under the constraint φ(n) ≤ m, while the syndeticity and pattern results add to the combinatorial number theory of this sparse set. The explicit constructions tied to consecutive primes constitute a strength, as they rest on the prime number theorem and Dirichlet's theorem and are therefore falsifiable with ordinary analytic tools.
minor comments (3)
- The abstract states multiple theorems; the introduction or §1 should include a numbered list of the main results with forward references to the sections containing their proofs.
- Notation for N_1(m) and N_1 is introduced clearly, but the paper should verify that the same symbols are used consistently when discussing the image set versus the maximal elements.
- The constructions involving consecutive primes would benefit from an explicit small numerical example (e.g., the first few terms of one infinite family) to illustrate the relation to prime gaps.
Simulated Author's Rebuttal
We thank the referee for the careful summary of our results and the positive recommendation for minor revision. The referee's description accurately captures the main contributions of the manuscript.
Circularity Check
No significant circularity; derivations rest on external number-theoretic facts
full rationale
The paper defines N1(m) via the standard maximizer of n subject to φ(n) ≤ m and derives its divisibility and syndeticity properties from the known multiplicative structure of φ together with the infinitude and distribution of primes (via PNT and Dirichlet). No parameter is fitted to a subset of the N1 values and then renamed as a prediction; no self-citation supplies a load-bearing uniqueness theorem or ansatz; the explicit constructions for non-squarefree divisors are direct and do not reduce to the definition by construction. The central claims therefore remain independent of the paper's own equations.
Axiom & Free-Parameter Ledger
axioms (2)
- standard math Euler's totient function satisfies its standard multiplicative and bounding properties
- standard math There exist infinitely many primes with controllable gaps
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.