Square-Free Integer¶
An integer not divisible by any perfect square greater than one, equivalently one whose prime factorization contains no repeated prime factor.
Core Idea¶
A square-free integer is divisible by no perfect square greater than one. Equivalently, its prime factorization contains no repeated prime: each exponent is zero or one. Thus a product of distinct primes is square-free, while an integer such as 18 is not because 3² divides it even though 18 is not itself a square. The property supports a unique square-free factorization of every positive integer into pairwise coprime square-free exponent layers. The property supports a unique square-free factorization of every positive integer into pairwise coprime square-free exponent layers.
Scope of Application¶
Use square-free integer with integer domain and sign convention, prime factorization or divisibility proof, any computational bound, and distinction from nonsquare or cubefree stated. Use square-free integer with integer domain and sign convention, prime factorization or divisibility proof, any computational bound, and distinction from nonsquare or cubefree stated.
- Number theory. Studies divisibility.
- Arithmetic functions. Uses the Möbius function.
- Factorization algorithms. Removes repeated prime powers.
- Diophantine equations. Controls repeated factors.
- Analytic number theory. Counts square-free values.
Clarity¶
The local exponent rule becomes a global divisibility property. It can be checked through factorization, gcd conditions, Möbius evaluation, or sieving depending on available information. The closest near miss sets the boundary: A nonsquare integer is closest: it is not itself a perfect square, but it may still contain a square factor, as 18 is divisible by 9.
Manages Complexity¶
Nonsquare and square-free differ sharply: the first excludes one global shape, while the second excludes every embedded nontrivial square divisor. The central factorization definition–efficient recognition tradeoff is this: Prime exponents are exact but full factorization can be costly. A second shared adjective–domain shift tension matters because Square-free extends to polynomials and ideals with changed factor notions.
Abstract Reasoning¶
Use three linked moves: fix integer conventions for sign, one, and zero; factor the absolute value or test prime-square divisibility; check every prime exponent is at most one. As a collapse test, the case exits as soon as one prime has exponent two or greater in the integer's factorization. A fourth check is to use Möbius or radical identities when justified.
Knowledge Transfer¶
Multiplicity-free factorization transfers to polynomials and ideals, but integer prime divisibility delimits this object. The nearest stopping boundary is explicit: A nonsquare integer is closest: it is not itself a perfect square, but it may still contain a square factor, as 18 is divisible by 9. The inclusion test remains: An integer is square-free when no prime square divides it, equivalently all prime exponents in its factorization are at most one. The structure no longer applies when the case exits as soon as one prime has exponent two or greater in the integer's factorization. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. It supplies the canonical test.
Neighborhood in Abstraction Space¶
Square-Free Integer sits in a moderately populated region (42nd percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Number-Theoretic Properties & Tests (20 abstractions)
Nearest neighbors
- Trial Division — 0.88
- Zero Divisor — 0.87
- Achilles Number — 0.87
- Regular prime — 0.87
- Least Common Multiple — 0.87
Computed from structural-signature embeddings · 2026-10-08