Let there be a polynomial , which is defined as above.
where is the cyclotomic polynomial .
How many distinct roots does have?
You may use a calculator for the final step of your calculation.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The n t h cyclotomic polynomial Φ n ( x ) has the primitive n t h roots of unity as its roots.
Thus, for each n t h cyclotomic polynomial, there are ϕ ( n ) distinct roots, where the function ϕ ( x ) is the Euler's totient function . (Note that Φ n ( x ) = ϕ ( x ) ! )
We are looking for the number of roots of the polynomial whose roots are all the primitive k t h roots of unity such that 1 ≤ k ≤ n . Since the primitive k t h roots of unity are relatively coprime for all integers k such that 1 ≤ k ≤ n , we see that
k = 1 ∏ n Φ k ( x )
will have all its roots distinct from one another. Thus, we can find its number of roots as
k = 1 ∑ n ϕ ( k )
Being the lazy person that I am, I generated a code for that.
However, mathematically and manually, the summation above can be simplified by the summatory function
= m = 1 ∑ n m d ∣ m ∑ d μ ( d )
where μ ( d ) is the Möbius function .
Using such equation above, we can evaluate it to n = 2 0 1 7 and arrive at the answer. Either way, that is 1 2 3 7 4 5 6 .