Taxicab number¶
The smallest positive integer expressible as a sum of two positive cubes in a specified number of distinct unordered ways.
Core Idea¶
Positive cubes distinguish taxicab from cabtaxi variants allowing negatives, and distinctness and ordering conventions must be fixed. Candidate sums of two positive cubes are grouped by value, representation multiplicity is counted and the least value attaining n representations is selected. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
The load-bearing residual is not the broad topic of recreational number theory. It is the domain-specific identity fixed by the representation count n, positive integer cube pairs, unordered and distinct convention, equal-sum equations, proof of all representations and minimality argument are explicit.
Scope of Application¶
Taxicab number belongs to recreational number theory and is useful where the analyst can specify the typed recreational number theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the representation count n, positive integer cube pairs, unordered and distinct convention, equal-sum equations, proof of all representations and minimality argument are explicit. The scope is broad within that domain but bounded by the need for the representation count n, positive integer cube pairs, unordered and distinct convention, equal-sum equations, proof of all representations and minimality argument are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the representation count n, positive integer cube pairs, unordered and distinct convention, equal-sum equations, proof of all representations and minimality argument are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Taxicab number can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Taxicab number. Taxicab number compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed recreational number theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the representation count n, positive integer cube pairs, unordered and distinct convention, equal-sum equations, proof of all representations and minimality argument are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of recreational number theory because they reuse the typed recreational number theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Candidate sums of two positive cubes are grouped by value, representation multiplicity is counted and the least value attaining n representations is selected., and type the carrier, state every parameter and convention in the definition, test that the representation count n, positive integer cube pairs, unordered and distinct convention, equal-sum equations, proof of all representations and minimality argument are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Taxicab number Domain-specific
Parents (1) — more general patterns this builds on
-
Taxicab number is a kind of Optimization Prime
The proposed strict upward parent is
prime:optimization.
Hierarchy path (1) — routes to 1 parentless root
- Taxicab number → Optimization
Neighborhood in Abstraction Space¶
Taxicab number sits in a crowded region of the domain-specific corpus (35th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Digit Properties & Recreational Numbers (6 abstractions)
Nearest neighbors
- Generalized taxicab number — 0.94
- Amenable number — 0.93
- 15 puzzle — 0.90
- Keith number — 0.90
- Dudeney number — 0.90
Computed from structural-signature embeddings · 2026-09-08