|
|
|
|
|
Let be a positive integer. Then the binomial has as many prime factors with integer coefficients as the integer has positive divisors, both numbers thus being .
Proof. If generally means the th cyclotomic polynomial
where the s are the primitive th roots of unity, then the equation
is true, because each th root of unity is also a primitive th root of unity for one and only one positive divisor of . The cyclotomic factor polynomials have integer coefficients and are irreducible. Thus the number of them is same as the number of positive divisors of .
For illustrating the proof, let (divisors 1, 2, 3, 6); think the sixth roots of unity: , , , , , (where
). From them,
is the primitive 1st root, the primitive 2nd root, and the primitive 3rd roots, and the primitive 6th roots of unity.
|
"factors of and " is owned by pahio.
|
|
(view preamble)
Cross-references: roots, polynomials, factor, equation, roots of unity, primitive, cyclotomic polynomial, numbers, divisors, coefficients, binomial, integer, positive
There is 1 reference to this entry.
This is version 4 of factors of and , born on 2007-01-16, modified 2007-08-19.
Object id is 8776, canonical name is FactorsOfNAndXn1.
Accessed 794 times total.
Classification:
| AMS MSC: | 11C08 (Number theory :: Polynomials and matrices :: Polynomials) | | | 11R18 (Number theory :: Algebraic number theory: global fields :: Cyclotomic extensions) | | | 11R60 (Number theory :: Algebraic number theory: global fields :: Cyclotomic function fields ) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|