Tips and tricks for computing cyclotomic polynumbers
84.2K subscribers
SUBSCRIBED
We give some of the main tools for explicitly computing cyclotomic polynumbers, having pointed out some of the logical difficulties both with their definition and more importantly their irreducibility in the previous lecture. To illustrate some of the ideas, we tackle the challenge of getting at Phi_1001. An important ingredient is the Euler totient function which counts the number of natural numbers less than or equal to a natural number n which are relatively prime to it. In general, the prime power decomposition of n has a lot to do with the calculation of Phi_n.