A natural number greater than 1 that has a positive divisor other than 1 and itself; equivalently, an integer that can be written as a product of two integers both greater than 1.

Principle

Composite numbers are exactly the positive integers >1 that are not prime; they admit nontrivial factorizations into smaller positive integers and therefore reflect the multiplicative structure built from primes.

Demonstration

Examples: 4 = 2×2, 6 = 2×3, 15 = 3×5; 12 is composite because it has divisors 2, 3, 4, 6 besides 1 and 12.

Misapplication

Calling 1 composite (it has no nontrivial divisors) or assuming every integer factorization behaves like the integers (ignoring rings without unique factorization) are common misuses.

Consequence

Composites determine factorization patterns, the structure of multiplicative arithmetic functions, and the complexity of integer factorization problems; composites are the targets of primality testing and factoring algorithms central to computational number theory and cryptography.

Reversal

Reversing the property yields primes and the special unit 1; viewing composites as complements of primes organizes the integers >1 into two classes with distinct arithmetic behavior.

Boundary

Applies to natural numbers >1 in Z; in algebraic settings one must distinguish composite integers from reducible elements in other rings, where factorization properties differ and units may vary.

Semantic Tension

Tension exists between the elementary concept of being composite and ring-theoretic reducibility: an integer composite in Z remains reducible in many rings but definitions diverge in non-UFDs, producing subtleties when generalizing.

Synthesis

A composite number is a positive integer greater than 1 that factors nontrivially; together with primes and the unit 1 it completes the basic multiplicative classification of the positive integers and underlies factorization theory and computational problems.