Sparsely Totient Number¶

A natural number n whose Euler totient is a strict suffix minimum: every larger integer m has φ(m) greater than φ(n).

Version: v1 · 2026-08-30 · History
Domain-specific #: 2816
Origin domain: number theory
Subdomain: arithmetic functions
Aliases: Sparsely totient integer

Core Idea¶

A Sparsely Totient Number is a natural number n such that φ(m) > φ(n) for every natural number m greater than n, where φ is Euler's totient function. Euler's totient φ(n) counts the positive integers at most n that are coprime to n, conventionally among 1 through n with the same standard value. The defining condition makes φ(n) a strict minimum across the entire infinite suffix after n.^[1]

This direction is easy to misread. The number is not selected because φ(n) is smaller than every earlier totient value. It is selected because no larger input ever returns a totient value as small as or smaller than φ(n). Equivalently, n is the largest preimage threshold associated with that low part of the totient range: once the natural-number input passes n, the function remains strictly above φ(n).

The locked identity is natural number n + Euler totient φ + ordinary ordering of inputs + universal comparison against every m > n + strict inequality φ(m) > φ(n) -> sparsely totient membership. The condition is global. Checking the next thousand integers can support discovery but cannot prove membership without a theorem bounding all later possibilities.

The first values include 2, 6, 12, 18, 30, 42, 60, 66, 90, 120, and 126. Masser and Shiu introduced and investigated the class, proving structural results including the membership of every primorial.^[1] Later work studies the largest prime factor and asymptotic properties of these extremal integers.^[2]

Structural Signature¶

candidate input n — a positive integer under the usual order;
arithmetic function — Euler's totient φ maps each integer to the count of coprime residues;
reference value φ(n) — the candidate's totient becomes the comparison threshold;
future domain — every integer m satisfying m > n, not a finite window or selected family;
strict inequality — each future value must satisfy φ(m) > φ(n);
global quantifier — one equal or smaller future totient disqualifies n;
suffix-minimum interpretation — the graph of φ never returns to the candidate's level or below after n;
multiplicative structure — prime factorization controls φ through φ(n) = n times the product over primes p dividing n of (1 - 1/p);
evenness consequence — an odd n greater than one fails because φ(2n) = φ(n) when n is odd;
primorial family — products of the first consecutive primes supply a canonical infinite subfamily;
sequence order — sparsely totient numbers themselves form an increasing sequence;
proof obligation — membership needs an all-larger-integers argument, while nonmembership needs only one witness.

The label “sparse” refers to extremal behavior of totient values and the resulting number-theoretic class. It does not mean that n has a sparse digit representation, few prime factors, or low density in a computational dataset.

What It Is Not¶

Not a number with a small totient in absolute terms. The condition is relative to every larger input.
Not a local minimum of φ. Comparing only neighbors or a finite interval is insufficient.
Not a record minimum from the left. Earlier integers do not appear in the defining inequality.
Not a highly totient number. Highly totient numbers are organized by how many solutions an equation φ(x) = k has, not this suffix-minimum property.
Not a nontotient. A nontotient is an integer absent from the image of φ; a sparsely totient number is an input to φ.
Not a sparsely represented number. Binary or decimal digit density is irrelevant.
Not every even integer. Evenness is necessary beyond trivial conventions, not sufficient.
Not only primorials. Every primorial belongs, but the sequence contains additional values.
Not implied by unique factorization alone. Prime factorization enables totient analysis but does not entail the global inequality.
Not a prime-number class. Members are generally composite.

Scope of Application¶

The node belongs to multiplicative and extremal number theory. It packages a recurring class whose membership can be studied through prime factorization, inequalities for φ, prime distribution, and construction of larger comparison integers. Research questions concern infinitude, distribution, largest prime factors, gaps, and relationships to primorials and related extremal sequences.

Masser and Shiu's 1986 paper established the named class and derived foundational results.^[1] Baker and Harman later analyzed largest prime factors of sparsely totient numbers, linking the class to results on primes in intervals.^[2] These are structural studies of an infinite sequence, not merely recreation or a catalog of computed terms.

Computation remains useful for generating initial terms and testing candidate lemmas. An algorithm can evaluate φ over a finite range and scan backward to identify suffix records relative to that range. The final few apparent records are provisional because an unseen later value may be equal or smaller. Certification requires a mathematical bound or a sufficiently justified search horizon for the specific claim.

Clarity¶

Suppose n is sparsely totient. For every m > n, the output φ(m) must lie above φ(n). The graph may fluctuate wildly, but it cannot cross back to that horizontal level. This makes n a right-to-left record if one inspects a finite prefix containing enough later values, though the genuine definition quantifies over the infinite tail.

Evenness illustrates the proof style. If n > 1 is odd, then 2n > n and φ(2n) = φ(n), because multiplying an odd number by 2 introduces a factor whose totient effect exactly doubles the input and halves the product factor. The strict inequality fails at m = 2n. Thus no such odd n qualifies. This supplies a disqualifying witness, not a positive membership test for even numbers.

Manages Complexity¶

The abstraction converts infinitely many comparisons into one named property. Rather than repeatedly writing the universal inequality, researchers can state that n is sparsely totient and invoke known lemmas about factorization, prime divisors, and constructed competitors.

It also separates input extremality from output extremality. φ is highly nonmonotone: larger integers can have much smaller totients because of their prime factors. Sparsely totient numbers identify positions after which a particular low output never recurs. This provides a structured way to study the lower envelope of a nonmonotone arithmetic function.

Abstract Reasoning¶

To disprove membership, it is enough to find one m > n with φ(m) ≤ φ(n).
To prove membership, a finite search is insufficient unless accompanied by a theorem excluding all larger counterexamples.
If n > 1 is odd, m = 2n supplies equality and defeats the strict condition.
If n is primorial, its dense collection of small prime divisors depresses the ratio φ(n)/n and supports extremal behavior, though the full proof is stronger than this heuristic.
If two candidates have the same totient and one is larger, the smaller one cannot be sparsely totient because the larger supplies an equality witness.
If φ(n+1) > φ(n), n need not qualify; a much later value may still be smaller.
If the inequality is weakened to non-strict ≥, a different class results because repeated totient values no longer disqualify.
If Euler's totient is replaced by another arithmetic function, the suffix-minimum skeleton transfers but the named class changes.
If computed terms are scanned only forward, record-low logic can be reversed accidentally; the comparison direction must be explicit.
If a claimed property depends only on n's digits, it is not explaining sparsely totient membership unless connected to factorization and φ.

Knowledge Transfer¶

The portable skeleton is ordered domain + function + candidate threshold + universal comparison over all later inputs -> strict suffix record. This structure appears in record theory and lower-envelope reasoning. Exact transfer of “sparsely totient” requires the natural numbers and Euler's totient function; a suffix minimum of another function should receive its own name.

The broader lesson is proof asymmetry. A universal extremal property is cheap to refute and expensive to certify. Computational candidate generation and mathematical verification should remain separate stages.

Examples¶

2: every m > 2 has φ(m) at least 2, while φ(2) = 1, so 2 qualifies under the standard convention;
6: φ(6) = 2 and every larger integer has totient greater than 2;
primorial: the product of the first k primes forms a canonical sparsely totient family;
odd failure: for odd n > 1, 2n is larger and has equal totient;
finite scan: a backward record in values up to N is a candidate, not automatically a theorem about all m > n;
equality witness: any later m with φ(m) = φ(n) disqualifies n because the condition is strict;
non-example—highly composite number: many divisors do not define the totient suffix property;
non-example—nontotient: an output absent from φ's range is not an input class.

Structural Tensions¶

finite discovery vs. infinite definition — computation finds candidates while proof must control the entire tail;
local oscillation vs. global envelope — nearby values reveal little about later counterexamples;
multiplicative formula vs. ordered comparison — φ is factorization-local while membership compares all larger inputs;
necessary evenness vs. sufficient structure — a simple filter removes half the integers and leaves a hard class;
primorial intuition vs. full sequence — dense small-prime factors explain a core family but not every member;
strictness vs. repeated values — equality, harmless in many extremal definitions, is fatal here.

Structural–Framed Character¶

Sparsely Totient Number is structural within number theory. The natural-number order, Euler's totient, and universal inequality fully determine membership. The adjective and typography are conventional; the mathematical class is not institution-dependent.

Structural Core vs. Domain Accent¶

The structural core is a strict suffix minimum of a function over an ordered domain. The domain accent is φ, coprimality, prime factorization, primorials, and natural-number asymptotics. Removing it yields Comparison or Function Mapping rather than the named abstraction.

Comparison — φ(n) is compared in one frame with every future φ(m).
Function Mapping — Euler's totient supplies the deterministic input-output rule.
Ordering — the predicate depends on m being greater than n.
Universal Quantification — every larger natural number must satisfy the inequality.
Counterexample — one later equal-or-smaller value refutes membership.

The minimal prospective DAG uses a composition edge to prime:comparison. Comparison is load-bearing, while the candidate adds its arithmetic function, infinite suffix, and strict extremal criterion.

Relationships to Other Abstractions¶

Current abstraction Sparsely Totient Number Domain-specific

Parents (1) — more general patterns this builds on

Sparsely Totient Number is part of Comparison Prime

φ(n) is compared in one frame with every future φ(m).

Hierarchy path (1) — routes to 1 parentless root

Sparsely Totient Number → Comparison → Self Checking

Neighborhood in Abstraction Space¶

Sparsely Totient Number sits in a sparse region of the domain-specific corpus (82^nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Computational Number Theory & Enumeration (13 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

highly totient number;
perfect totient number;
sparsely Schemmel totient number;
nontotient or cototient;
primorial as the entire class;
highly composite number;
local or left-to-right record of φ;
low digit density;
a finite-list suffix record without certification.

References¶

[1] David W. Masser and Peter M. Shiu, “On Sparsely Totient Numbers,” Pacific Journal of Mathematics 121(2) (1986), 407–426, https://doi.org/10.2140/pjm.1986.121.407. registry ↩a ↩b ↩c

[2] Roger C. Baker and Glyn Harman, “Sparsely Totient Numbers,” Annales de la Faculté des Sciences de Toulouse 5(2) (1996), 183–190, https://doi.org/10.5802/afst.826. registry ↩a ↩b

[3] “Sparsely totient number,” Wikipedia, frozen revision 1339846095, https://en.wikipedia.org/wiki/Sparsely_totient_number. registry