Friendly number¶

A positive integer sharing its abundancy index—the sum of divisors divided by the integer—with at least one distinct positive integer.

Version: v1 · 2026-09-08 · History
Domain-specific #: 4623
Origin domain: number theory
Subdomain: number theory

Core Idea¶

Friendly is relational rather than a claim of abundance, solitary status may be unknown and the divisor-sum convention includes all positive divisors. The sum-of-divisors function is normalized by n, and integers with equal rational values are grouped into equivalence classes; members of non-singleton classes are friendly. 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 number theory. It is the domain-specific identity fixed by the positive integer n, divisor-sum function sigma, abundancy index sigma(n)/n, a distinct integer m with equal index, equivalence relation and friendly class, pair or tuple terminology, solitary numbers and known versus unresolved status are explicit.

Scope of Application¶

Friendly number belongs to number theory and is useful where the analyst can specify the typed number theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the positive integer n, divisor-sum function sigma, abundancy index sigma(n)/n, a distinct integer m with equal index, equivalence relation and friendly class, pair or tuple terminology, solitary numbers and known versus unresolved status are explicit. The scope is broad within that domain but bounded by the need for the positive integer n, divisor-sum function sigma, abundancy index sigma(n)/n, a distinct integer m with equal index, equivalence relation and friendly class, pair or tuple terminology, solitary numbers and known versus unresolved status are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the positive integer n, divisor-sum function sigma, abundancy index sigma(n)/n, a distinct integer m with equal index, equivalence relation and friendly class, pair or tuple terminology, solitary numbers and known versus unresolved status 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.

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 Friendly number. Friendly 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 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 positive integer n, divisor-sum function sigma, abundancy index sigma(n)/n, a distinct integer m with equal index, equivalence relation and friendly class, pair or tuple terminology, solitary numbers and known versus unresolved status are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of number theory because they reuse the typed number theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, The sum-of-divisors function is normalized by n, and integers with equal rational values are grouped into equivalence classes; members of non-singleton classes are friendly., and type the carrier, state every parameter and convention in the definition, test that the positive integer n, divisor-sum function sigma, abundancy index sigma(n)/n, a distinct integer m with equal index, equivalence relation and friendly class, pair or tuple terminology, solitary numbers and known versus unresolved status are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Friendly number Domain-specific

Parents (1) — more general patterns this builds on

Friendly number is a kind of Classification Prime

The proposed strict upward parent is prime:classification.

Hierarchy path (1) — routes to 1 parentless root

Friendly number → Classification

Neighborhood in Abstraction Space¶

Friendly number sits in a crowded region of the domain-specific corpus (3^rd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Number-Theoretic Sequences & Classes (37 abstractions)

Nearest neighbors

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