Achilles Number¶

A positive integer that is powerful because every prime exponent is at least two, yet is not a perfect power because those exponents have greatest common divisor one.

Version: v1 · 2026-09-28 · History
Domain-specific #: 7851
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Elementary Number Theory, Recreational Mathematics → Mathematics

Core Idea¶

Achilles numbers combine strength and imperfection in prime-exponent form. If n=∏p_i^{a_i}, every a_i must be at least two, so n is powerful; at the same time gcd(a_i)=1, so no exponent k>1 can be factored from all powers.

The two tests are independent and exact. Strong Achilles numbers add a further condition on Euler’s totient, but that subtype should not be folded into ordinary membership.

How would you explain it like I'm…

Strong Numbers With a Weak Spot

Every number can be broken into building-block numbers multiplied together, like 72 = 2 × 2 × 2 × 3 × 3. An Achilles number is one where every building block shows up at least twice, which makes it strong. But you still can't make it by multiplying one number by itself, like 6 × 6 or 2 × 2 × 2. Like the hero Achilles, it's strong but not perfect.

Powerful but Not a Power

Every whole number can be broken into prime numbers multiplied together. An Achilles number passes two tests. First, every prime in it shows up at least twice - numbers like that are called powerful. Second, it isn't a perfect power, meaning you can't get it by multiplying some smaller whole number by itself two or more times. For example, 72 is 2 x 2 x 2 x 3 x 3, so it's powerful, and it isn't a square or a cube or any other perfect power, so it's an Achilles number. But 36 is 6 x 6, so even though it's powerful, it's not one.

Powerful Non-Perfect-Power Numbers

Write a number as a product of primes, n = p1^a1 x p2^a2 x ... An Achilles number meets two separate conditions on those exponents. First, every exponent is at least 2, which makes n a powerful number. Second, the exponents have no common factor bigger than 1 (their greatest common divisor is 1), which means n is not a perfect power - there's no single exponent k greater than 1 you could pull out of all of them to write n as m^k. So 72 = 2^3 x 3^2 qualifies, while 36 = 2^2 x 3^2 = 6^2 does not. The two tests are independent: a number can pass one and fail the other. There's also a stricter subtype, strong Achilles numbers, which adds a condition involving Euler's totient function, but that is not part of the ordinary definition.

An Achilles number is a positive integer that is powerful but not a perfect power, a combination of 'strength' and 'imperfection' read directly off its prime factorization. If n = product of p_i^{a_i}, then n is powerful when every a_i is at least 2, and n is not a perfect power when gcd(a_i) = 1, since a common divisor k > 1 of all exponents would let n be written as m^k. Both tests are exact and logically independent: 36 = 2^2 x 3^2 is powerful but a perfect square, while 12 = 2^2 x 3 has coprime exponents but is not powerful. 72 = 2^3 x 3^2 satisfies both and is an Achilles number. Strong Achilles numbers impose a further condition involving Euler's totient function, and that subtype should be kept separate from ordinary membership.

Scope of Application¶

Number theory. Studies multiplicative integer classes.
Integer sequences. Enumerates and estimates occurrence.
Factorization algorithms. Tests exponent patterns.
Recreational mathematics. Uses the Achilles naming analogy.

Clarity¶

State positive-integer convention, complete prime factorization, all exponents, minimum exponent, exponent gcd, perfect-power conclusion, and whether the strong totient condition is being tested. Inclusion test: Factor a positive integer, require all prime exponents at least two, then require their gcd to equal one. Exclusion test: Exclude powerful perfect powers, nonpowerful numbers with exponent one, primes, and strong-Achilles status inferred without testing Euler's totient. Nearest boundary: Every perfect power with exponents at least two is powerful, but Achilles numbers are precisely the powerful cases whose exponent vector is primitive under gcd. Exit condition: Changing one exponent to one destroys powerfulness; making all exponents share a common divisor greater than one makes the number a perfect power. Common misclassifications: It is not every powerful number. It is not a perfect power. A composite with any prime exponent one fails. Strong Achilles is a stricter subtype. Nearest named distinctions: Powerful number: May also be a perfect power. Perfect power: Has exponent gcd greater than one. Squareful number: Is commonly synonymous with powerful, hence broader. Strong Achilles number: Also requires φ(n) to be Achilles.

Manages Complexity¶

Membership is a concise conjunction of a coordinatewise lower bound and a global gcd condition on the unique exponent vector.

Abstract Reasoning¶

Factor n completely.
Reject if any exponent is below two.
Compute the gcd of all exponents.
Accept exactly when that gcd is one.
For strong status, factor and test φ(n) separately.

Knowledge Transfer¶

The criterion transfers directly to exact prime factorizations, but probabilistic or partial factorization cannot certify membership unless missing factors and exponents are controlled.

Relationships to Other Abstractions¶

Current abstraction Achilles Number Domain-specific

Parents (1) — more general patterns this builds on

Achilles Number presupposes Classification Prime

Achilles Number presupposes Classification because membership is determined by a rule over prime exponents: all at least two with greatest common divisor one.

Hierarchy path (1) — routes to 1 parentless root

Achilles Number → Classification

Neighborhood in Abstraction Space¶

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

Family — Number & Formal Language Properties (7 abstractions)

Nearest neighbors

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