Linked from

The 13 pages that link to Composite number, each with the reason it gives.

• Prime numberCompared with: Composite numbers are precisely the natural numbers greater than 1 that are not prime.

• Prime factorizationCompared with: Composite integers can be split into smaller factors before reaching primes.

• Integer factorizationRelated: A composite number is precisely the kind of input that can be split into nontrivial factors.

• Primality testCompared with: A compositeness witness can conclusively reject a candidate as prime.

• Euclid's lemmaCompared with: A composite divisor of a product need not divide either factor, unlike a prime.

• Trial divisionRelated: Finding such a divisor is exactly what makes a trial-division primality test fail.

• Sieve of EratosthenesRelated: Every number the sieve eliminates has a prime divisor and is therefore composite.

• Even numberCompared with: Evenness alone does not imply compositeness because 2 is prime.

• Euclid's theoremCompared with: The constructed number need not be prime; any prime factor suffices.

• Fermat numberRelated: Most known Fermat numbers are composite, often with factors that reveal their structure.

• Agoh–Giuga conjectureCompared with: A single composite satisfying the congruence would disprove the conjecture.

• Agrawal's conjectureCompared with: The conjecture predicts a nonzero intermediate coefficient for every composite modulus.

• Grimm's conjectureNarrower topic: The conjecture concerns sequences made entirely of these integers.