Abstract
where the 'indicates that the index k runs through integers relatively prime to n. The degree of Fn(x) is +(n), Euler's totient. This paper determines the resultant p(Fm, Fn) of any two cyclotomic polynomials Fm and Fn. Explicit formulas are given which show that if m$n the resultant is either 1, -2, or a prime power. For the case m > n > 1 the results agree with a formula derived by Diederichsen [3, Hilfssatz 2] in a paper on group representations (see Theorem 4 below). Our proof is different from and somewhat simpler than that of Diederichsen; it is based on the following lemma on decompositions of reduced residue systems which the author has recently used to relate Gauss sums and primitive characters [1, Lemma 6].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.