Difference between revisions of "Divisor"
m (→Definition) |
IntrepidMath (talk | contribs) |
||
| Line 1: | Line 1: | ||
===Definition=== | ===Definition=== | ||
| − | Any [[natural number]] <math>\displaystyle{d}</math> is called a divisor of a natural number <math>\displaystyle{n}</math> if there is a natural number <math>\displaystyle{k}</math> such that <math>n=kd</math> or, in other words, if <math>\displaystyle\frac nd</math> is also a natural number. | + | Any [[natural number]] <math>\displaystyle{d}</math> is called a divisor of a natural number <math>\displaystyle{n}</math> if there is a natural number <math>\displaystyle{k}</math> such that <math>n=kd</math> or, in other words, if <math>\displaystyle\frac nd</math> is also a natural number. 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. | ||
===How many divisors does a number have=== | ===How many divisors does a number have=== | ||
| Line 12: | Line 15: | ||
*[[Number theory]] | *[[Number theory]] | ||
*[[GCD]] | *[[GCD]] | ||
| + | *[[Divisibility]] | ||
Revision as of 12:39, 21 June 2006
Contents
Definition
Any natural number 
is called a divisor of a natural number 
if there is a natural number 
such that 
or, in other words, if 
is also a natural number. 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.
How many divisors does a number have
See main article, Counting divisors. If 
is the prime factorization of , then the number 
of different divisors of 
is given by the formula 
. It is often useful to know that this expression grows slower than any positive power of as 
. Another useful idea is that is odd if and only if is a perfect square.
Useful formulae
- If
and 
are relatively prime, then 
![$\displaystyle{\sum_{n=1}^N d(n)=\left[\frac N1\right]+\left[\frac N2\right]+\dots+\left[\frac NN\right]= N\ln N+O(N)}$](//latex.artofproblemsolving.com/a/9/8/a98664acaee0cdf2e8a2201dc9c5f4971e5db6cf.png)
and 
![$\displaystyle{\sum_{n=1}^N d(n)=\left[\frac N1\right]+\left[\frac N2\right]+\dots+\left[\frac NN\right]= N\ln N+O(N)}$](http://latex.artofproblemsolving.com/a/9/8/a98664acaee0cdf2e8a2201dc9c5f4971e5db6cf.png)
