AoPSWiki
Trying to get to the USAMO in 2010? Our AIME Problem Series can help you get there! Click here to enroll today!

Divisor

From AoPSWiki

Revision as of 03:43, 1 June 2008 by Metafor (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

A natural number {d} is called a divisor of a natural number {n} if there is a natural number {k} such that n=kd or, in other words, if \frac nd is also a natural number (i.e d divides n). See Divisibility for more information.

Notation

A common notation to indicate a number is a divisor of another is n|k. This means that n divides k.


See the main article on counting divisors. If n=p_{1}^{\alpha_{1}} \cdot p_{2}^{\alpha_{2}}\cdot\dots\cdot p_m^{\alpha_m} is the prime factorization of {n}, then the number d(n) of different divisors of n is given by the formula d(n)=(\alpha_{1} + 1)\cdot(\alpha_{2} + 1)\cdot\dots\cdot(\alpha_{m} + 1). It is often useful to know that this expression grows slower than any positive power of {n} as n\to\infty. Another useful idea is that d(n) is odd if and only if {n} is a perfect square.

Useful formulae

See also

Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us