Refactorable number¶

Classify a positive integer as refactorable when the number of its positive divisors divides the integer itself.

Version: v1 · 2026-08-30 · History
Domain-specific #: 2643
Origin domain: mathematics
Subdomain: divisor function predicate
Aliases: Tau number, Tau-divisible number

Core Idea¶

A refactorable number, or tau number, is a positive integer \(n\) satisfying \(\tau(n)\mid n\), where \(\tau(n)\) counts the positive divisors of \(n\). If \(n=\prod_i p_i^{e_i}\), then \(\tau(n)=\prod_i(e_i+1)\). The defining test first computes divisor count from the prime-exponent vector and then tests divisibility of \(n\) by that count. The property defines an infinite but sparse integer sequence.^[1]

Prime factorization supplies divisor count without enumerating each divisor. The exponent product yields \(\tau(n)\); modular division then decides membership. For \(18=2\cdot3^2\), the count is \((1+1)(2+1)=6\), and \(6\mid18\), so 18 is refactorable. The property couples a multiplicative arithmetic function to the integer it measures, which creates congruence, density, and adjacency questions distinct from generic divisor-function study.^[2]

Refactorable does not mean factorable in the ordinary sense, because every composite integer factors. It differs from a perfect number, whose proper-divisor sum equals the number, and from a highly composite number, whose divisor count exceeds those of smaller integers. The name was independently popularized through machine discovery after earlier tau-number work, so historical attribution must preserve both research lines. Zero and negative integers are excluded unless an author explicitly extends the convention.^[3]

Structural Signature¶

Positive integer. A number \(n\ge1\) supplies the candidate.
Prime factorization. Exponents determine the divisor count.
Divisor-count function. The arithmetic function \(\tau(n)\) supplies the internal statistic.
Divisibility test. Membership requires zero remainder on division by \(\tau(n)\).
Integer sequence. All satisfying values form an ordered sparse family.
Density behavior. Asymptotic prevalence distinguishes infinity from frequency.
Congruence restrictions. Residue and adjacency theorems constrain placement.
Discovery provenance. Earlier tau-number work and later machine rediscovery share attribution.

What It Is Not¶

Not a composite number. Primality or compositeness alone does not decide the predicate.
Not a perfect number. Perfect numbers use the divisor-sum function.
Not a highly composite number. That property compares divisor counts with all smaller integers.
Not a practical factoring method. The name does not describe an algorithm for finding factors.
Not a tau function value. The candidate is \(n\), not merely \(\tau(n)\).
Not all integers. The standard sequence uses positive integers.

Scope of Application¶

The abstraction is literal wherever practitioners can identify the same constitutive roles, apply the same boundary tests, and obtain the same kind of output. The following habitats are uses of Refactorable number itself, not metaphors based only on resemblance.

Elementary number theory. Studying interaction between \(n\) and its divisor count.
Integer-sequence research. Enumerating values and testing conjectured patterns.
Analytic number theory. Estimating counting functions and natural density.
Congruence analysis. Constraining refactorable numbers in residue classes.
Machine discovery. Examining rediscovery and automated concept formation.
Algorithmic enumeration. Generating candidates from factorizations with correctness checks.

Clarity¶

A clear account of Refactorable number must preserve the recognition invariant stated in the Core Idea rather than rely on the title alone. Define \(\tau(n)\) as the count of positive divisors and fix the domain \(n\ge1\). Use the prime-exponent formula under a verified factorization. Separate infinitude, natural density, and counting-function asymptotics. Distinguish historical priority from the later refactorable name. These declarations are not editorial extras: each changes what observations count, which transformations are licensed, and what conclusion can be drawn. A reader should be able to reconstruct the input, the operative rule, the output, and at least one defeater from the account without consulting an implementation or guessing an unstated convention.

Manages Complexity¶

Refactorable number manages complexity by replacing a diffuse field of observations or possible operations with a bounded role structure: positive integer supplies a number \(n\ge1\) supplies the candidate.; prime factorization supplies exponents determine the divisor count.; divisor-count function supplies the arithmetic function \(\tau(n)\) supplies the internal statistic.; divisibility test supplies membership requires zero remainder on division by \(\tau(n)\).; integer sequence supplies all satisfying values form an ordered sparse family.. The compression is useful because it localizes disagreement. One can ask whether the input was properly formed, whether a constitutive relation held, whether an alternative explanation defeats the inference, or whether the output was overinterpreted. The same compression can mislead when its discarded detail is exactly what the decision requires. A reference-grade use therefore reports both the invariant retained and the information intentionally lost.

Abstract Reasoning¶

Factor the positive integer into prime powers.
Multiply each exponent plus one to obtain \(\tau(n)\).
Divide \(n\) by \(\tau(n)\) and inspect the remainder.
Classify membership without importing unrelated divisor-sum properties.
For sequence claims, verify the generation range and duplicate handling.
State whether a theorem proves infinitude, density, or only a bound.
Test conjectures against known congruence and adjacency results.
Test the candidate interpretation against the nearest named confusable rather than accepting a shared surface feature.
State the conclusion at the same scope as the source conditions, and retain uncertainty or nonuniqueness where the construct does not remove it.

Knowledge Transfer¶

The strict upward abstraction is Predicate. Refactorable Number instantiates Predicate because \(\tau(n)\mid n\) assigns a definite truth value to each positive integer. Within divisor function predicate, the full mechanism transfers literally when the same roles and boundary tests recur. Beyond that domain, only the parent-level skeleton should travel. Reusing the label Refactorable number after removing its constitutive vocabulary would hide a change of mechanism behind an analogy. The honest transfer rule is therefore two-stage: recognize the domain-specific pattern first, then lift only the parent relation that remains invariant under a substrate change.

Examples¶

Canonical¶

For \(n=18=2^1 3^2\), \(\tau(18)=(1+1)(2+1)=6\), and \(18/6=3\), so 18 is refactorable. For \(n=10=2\cdot5\), \(\tau(10)=4\), and \(4\nmid10\), so 10 is not. The examples show the predicate rather than merely listing factors.

Mapped back: input and conventions → constitutive role test → bounded output → explicit interpretation and defeater check.

Applied / In Practice¶

An enumeration program stores each candidate's factorization, computes the exponent product, and records only zero remainders. Its output is checked against published initial terms. A newly observed residue pattern is labeled a conjecture until proved and is not confused with the established zero-density result.

Mapped back: field observation or problem → candidate recognition → confusable and limit checks → appropriately scoped conclusion.

Structural Tensions¶

T1: Simple definition versus difficult distribution. Membership is easy after factorization, but counting is subtle. Diagnostic: Separate pointwise testing from asymptotic claims.
T2: Infinitude versus density. An infinite sequence can have natural density zero. Diagnostic: State both properties independently.
T3: Machine rediscovery versus prior art. Later naming can obscure earlier tau-number work. Diagnostic: Cite both historical sources.
T4: Factorization cost versus predicate simplicity. Computing \(\tau\) may require difficult factorization. Diagnostic: Report the computational model.
T5: Examples versus general theorem. Long tables can suggest unsupported patterns. Diagnostic: Demand proof or bounded empirical wording.
T6: Autonomy versus generic predicate. Predicate supplies truth-valued classification; refactorability fixes the self-referential divisor-count divisibility test. Diagnostic: Replace \(\tau\) with another arithmetic function and test whether the named sequence changes.

Structural–Framed Character¶

The divisor-count divisibility test is structural; discovery history, computational range, and conjectural importance are framed. The five framing criteria point in a consistent direction. Evaluative weight is limited to whether the defining conditions are met, not whether the outcome is desirable. Human practice matters to the extent that experts choose conventions, instruments, or reporting thresholds, but those choices do not make every verdict arbitrary. Institutional history explains the name and standard use; it does not replace the recognition rule. The operative vocabulary travels within the home field and closely adjacent subfields, while transfer farther away requires translation to the parent prime. Thus recognition remains disciplined even where interpretation is defeasible.

Structural Core vs. Domain Accent¶

What is skeletal. Refactorable Number instantiates Predicate because \(\tau(n)\mid n\) assigns a definite truth value to each positive integer. This is the part that can be expressed without the candidate's specialist nouns.

What is domain-bound. The domain accent includes positive integers, prime exponents, divisor function, divisibility, density, congruences, sequences, and automated discovery. Remove those elements and the result is no longer Refactorable number; it is only the parent relation or a loose analogy.

Why this does not clear the prime bar. The name does not recur with unchanged diagnostics across three independent domains. What transfers is already represented by prime:predicate. The candidate remains autonomous because its in-domain recognition rule, failure modes, and consequences are stable, but its vocabulary and interventions do not float free of the home substrate.

Refactorable Number instantiates Predicate because \(\tau(n)\mid n\) assigns a definite truth value to each positive integer.

The prospective workspace queue contains one strict upward edge to prime:predicate. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Refactorable number Domain-specific

Parents (1) — more general patterns this builds on

Refactorable number is a kind of Predicate Prime

Refactorable Number instantiates Predicate because \(\tau(n)\mid n\) assigns a definite truth value to each positive integer.

Hierarchy path (1) — routes to 1 parentless root

Refactorable number → Predicate → Relation

Neighborhood in Abstraction Space¶

Refactorable number sits in a sparse region of the domain-specific corpus (76^th 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

Sublime number — 0.84
Fermat number — 0.84
Divisor Function — 0.83
Arithmetic number — 0.82
Smooth Number — 0.82

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

Not to Be Confused With¶

Perfect number. Uses equality with the sum of proper divisors.
Highly composite number. Maximizes divisor count relative to earlier integers.
Practical number. Concerns representing smaller integers as sums of divisors.
Multiplicative perfect number. Uses product of divisors under another equation.
Divisor function. The arithmetic function used by the predicate.
Factorable number. An informal surface unrelated to the tau-number condition.

References¶

[1] Kennedy, R. E., and Cooper, C. N. (1990). ‘Tau Numbers, Natural Density, and Hardy and Wright's Theorem 437.’ International Journal of Mathematics and Mathematical Sciences 13(2), 383–386. https://doi.org/10.1155/S0161171290000876 registry ↩

[2] Colton, S. (1999). ‘Refactorable Numbers—A Machine Invention.’ Journal of Integer Sequences 2, Article 99.1.2. https://cs.uwaterloo.ca/journals/JIS/colton/joisol.html registry ↩

[3] Zelinsky, J. (2002). ‘Tau Numbers: A Partial Proof of a Conjecture and Other Results.’ Journal of Integer Sequences 5, Article 02.2.8. https://cs.uwaterloo.ca/journals/JIS/VOL5/Zelinsky/zelinsky9.pdf registry ↩