Misplaced Pages

This is an old revision of this page, as edited by Hayson1991 (talk | contribs) at 21:49, 13 May 2008 (→Kinds of composite numbers). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

v t e Divisibility-based sets of integers
Overview	Integer factorization Divisor Unitary divisor Divisor function Prime factor Fundamental theorem of arithmetic
Factorization forms	Prime Composite Semiprime Pronic Sphenic Square-free Powerful Perfect power Achilles Smooth Regular Rough Unusual
Constrained divisor sums	Perfect Almost perfect Quasiperfect Multiply perfect Hemiperfect Hyperperfect Superperfect Unitary perfect Semiperfect Practical Descartes Erdős–Nicolas
With many divisors	Abundant Primitive abundant Highly abundant Superabundant Colossally abundant Highly composite Superior highly composite Weird
Aliquot sequence-related	Untouchable Amicable (Triple) Sociable Betrothed
Base-dependent	Equidigital Extravagant Frugal Harshad Polydivisible Smith
Other sets	Arithmetic Deficient Friendly Solitary Sublime Harmonic divisor Refactorable Superperfect

A composite number is a positive integer which has a positive divisor other than one or itself. In other words, if 0 < n is an integer and there are integers 1 < a, b < n such that n = a × b then n is composite. By definition, every integer greater than one is either a prime number or a composite number. The number one is a unit - it is neither prime nor composite. For example, the integer 14 is a composite number because it can be factored as 2 × 7.

The first 15 composite numbers (sequence A002808 in the OEIS) are

4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, and 25.

Properties

• Every composite number can be written as the product of 2 or more (not necessarily distinct) primes (Fundamental theorem of arithmetic).
• Also, ${\displaystyle (n-1)!\,\,\,\equiv \,\,0{\pmod {n}}}$ for all composite numbers n > 5. See also Wilson's theorem.

Kinds of composite numbers

One way to classify composite numbers is by counting the number of prime factors. A composite number with two prime factors is a semiprime or 2-almost prime (the factors need not be distinct, hence squares of primes are included). A composite number with three distinct prime factors is a sphenic number. In some applications, it is necessary to differentiate between composite numbers with an odd number of distinct prime factors and those with an even number of distinct prime factors. For the latter

${\displaystyle \mu (n)=(-1)^{2n}=1\,}$

(where μ is the Möbius function and x is half the total of prime factors), while for the former

${\displaystyle \mu (n)=(-1)^{2n+1}=-1.\,}$

Note however that for prime numbers the function also returns -1, and that ${\displaystyle \mu (1)=1}$. For a number n with one or more repeated prime factors, ${\displaystyle \mu (n)=0}$.

If all the prime factors of a number are repeated it is called a powerful number. If none of its prime factors are repeated, it is called squarefree. (All prime numbers and 1 are squarefree.)

Another way to classify composite numbers is by counting the number of divisors. All composite numbers have at least three divisors. In the case of squares of primes, those divisors are ${\displaystyle \{1,p,p^{2}\}}$. A number n that has more divisors than any x < n is a highly composite number (though the first two such numbers are 1 and 2).

External links

• Java applet: Factorization using the Elliptic Curve Method to find very large composites
• Lists of composites with prime factorization (first 100, 1,000, 10,000, 100,000, and 1,000,000)

• Prime numbers
• Elementary arithmetic