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. It is also detected by the Möbius function: μ(n) is nonzero exactly when positive n is square-free. Counting results show that square-free positive integers have asymptotic density 6/π². Sign does not change prime exponents for a nonzero integer; conventions for one, negative numbers, and especially zero should be stated in the surrounding domain.
Structural Signature¶
Sig role-phrases:
- integer candidate. Supplies the whole number whose divisibility is classified. Constitutive carrier. If altered: Polynomial and ideal square-freeness are related but different domains.
- prime factorization. Expresses the integer through distinct primes and exponents. Constitutive analysis. If altered: For zero, divisibility behavior requires separate convention.
- exponent-at-most-one condition. Requires every prime exponent to be zero or one. Identity-bearing rule. If altered: Any exponent at least two supplies a square divisor.
- square-divisor test. Checks that no
p²or larger nontrivial square divides the integer. Equivalent recognition test. If altered: Testing only one small square is insufficient. - arithmetic consequences. Connects the property to Möbius values, radical, counting, and square-free decompositions. Diagnostic consequence. If altered: Consequences do not replace the factor criterion.
What It Is Not¶
- Nonsquare. Can a square still divide the number?
- Cubefree. Are exponent-two factors allowed?
- Prime. Can several distinct primes occur?
- Square-free polynomial. Which factorization domain applies?
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.
- 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.
Manages Complexity¶
Nonsquare and square-free differ sharply: the first excludes one global shape, while the second excludes every embedded nontrivial square divisor.
Abstract Reasoning¶
- 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.
- Use Möbius or radical identities when justified.
- Separate square-free from nonsquare and higher-power-free properties.
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.
Examples¶
Canonical¶
Thirty is square-free because 30 = 2·3·5 and every prime exponent is one; no square greater than one divides it.
Mapped back: integer candidate → 30; prime factorization → 2·3·5; exponent-at-most-one condition → all exponents one; square-divisor test → none; arithmetic consequences → nonzero Möbius value.
Applied / In Practice¶
Eighteen is not a perfect square, but 18 = 2·3²; the repeated factor supplies square divisor 9, so it is not square-free.
Mapped back: integer candidate → 18; prime factorization → 2·3²; exponent-at-most-one condition → fails for 3; square-divisor test → 9 divides 18; arithmetic consequences → Möbius value zero.
Structural Tensions¶
T1: factorization definition vs. efficient recognition. Prime exponents are exact but full factorization can be costly. Diagnostic: Which equivalent test is justified?
T2: shared adjective vs. domain shift. Square-free extends to polynomials and ideals with changed factor notions. Diagnostic: What factorization domain is active?
Structural–Framed Character¶
Description turns on integer candidate, prime factorization, exponent-at-most-one condition, square-divisor test, arithmetic consequences. Skeletal core. A decomposable object is classified by forbidding repeated irreducible factors. Domain-bound accent. Integers, primes, exponents, divisibility, Möbius values, and density define square-freeness here. Transfer remains bounded because Why not prime. Multiplicity-free decomposition is portable; this is the integer case. The negative boundary is concrete: Any prime, odd number, nonsquare, powerful number, cubefree integer, radical, square-free polynomial, square-free word, or product of distinct-looking composite factors is not automatically a square-free integer. Square-free integers are structural-formal: prime multiplicities alone determine the property. Its character: an integer factorization with every prime appearing at most once.
Structural Core vs. Domain Accent¶
Skeletal core. A decomposable object is classified by forbidding repeated irreducible factors.
Domain-bound accent. Integers, primes, exponents, divisibility, Möbius values, and density define square-freeness here.
Why not prime. Multiplicity-free decomposition is portable; this is the integer case.
Instantiates / Related Primes¶
- Prime factorization. It supplies the canonical test.
- Möbius function. It detects the property.
- No strict parent is asserted.
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
Not to Be Confused With¶
- Nonsquare. Tell: Can a square still divide the number?
- Cubefree. Tell: Are exponent-two factors allowed?
- Prime. Tell: Can several distinct primes occur?
- Square-free polynomial. Tell: Which factorization domain applies?
References¶
- Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Square-free_integer (revision 1363371285).
- Preserved source candidate: https://www.cse.iitk.ac.in/users/manindra/algebra/primality_original.pdf
- Preserved source candidate: http://www.mat.uniroma3.it/users/pappa/papers/allahabad2003.pdf
- Preserved source candidate: http://www.math.ualberta.ca/~kansinha/maxnrevfinal.pdf
- Preserved source candidate: https://web.archive.org/web/20120214074050/http://www.math.ualberta.ca/~kansinha/maxnrevfinal.pdf
- Preserved source candidate: https://gdz.sub.uni-goettingen.de/id/PPN266833020_0030?tify={%22pages%22:[437
- Preserved source candidate: https://www.springer.com/book/9780387960630
- Preserved source candidate: https://projecteuclid.org/euclid.pja/1195517398
- Preserved source candidate: https://www.ams.org/journals/mcom/0000-000-00/S0025-5718-2024-04039-5/
The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.