Number of the divisors: Difference between revisions
just a note about an interesting function |
Cleanup |
||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
{{Wikipedia| Table of divisors }} | |||
The '''number of divisors''' {{w|Divisor function|d(''n'')}} of a number ''n'' can be found from its [[prime factorization]] as the product of the by-one incremented exponents of all present prime bases. | |||
== | If the number ''n'' has the prime factorization | ||
<math>\displaystyle n = p_1^{e_1}\cdot p_2^{e_2}\dotsm p_r^{e_r},</math> | |||
then:<ref>G. H. Hardy, E. M. Wright: ''An Introduction to the Theory of Numbers.'' 4. Edition, Oxford University Press, Oxford 1975. ISBN 0-19-853310-1, Theoreme 273, p. 239.</ref> | |||
<math>\displaystyle d(n) = (e_1 + 1)(e_2 + 1) \dotsm (e_r + 1)</math> | |||
For {{w|Coprime integers|coprime}} numbers ''m'' and ''n'' it follows that | |||
<math>\displaystyle d(mn) = d(m) \cdot d(n)</math> | |||
== Examples == | |||
{| class="wikitable" | {| class="wikitable" | ||
| Line 27: | Line 34: | ||
| <math>d(30) = (1+1)(1+1)(1+1) = 8</math> | | <math>d(30) = (1+1)(1+1)(1+1) = 8</math> | ||
|} | |} | ||
== See also == | |||
* [[Highly composite equal division]] | |||
== References == | == References == | ||
| Line 34: | Line 45: | ||
== External links == | == External links == | ||
* {{OEIS|A000005}} | * {{OEIS|A000005}} | ||
[[Category:Math]] | [[Category:Math]] | ||