Find S = − ∑ lo g 2 ( 1 − cos ( 2 0 1 5 2 k π ) )
where the sum is taken over all 1 ≤ k ≤ 2 0 1 5 with g cd ( k , 2 0 1 5 ) = 1 .
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.
write the sum as − lo g 2 ( ∏ ( 1 − cos ( 2 0 1 5 2 k π ) ) ) let w be the primitive 2015th roots of unity. then by eulers identity this becomes − lo g 2 ( ∏ ( 1 − 2 w + w − 1 ) ) = − lo g 2 ( ∏ ( w − 1 2 ( 1 − w ) 2 ) ) product of all the primitive roots for all number≠2 are 1. neglect that.
a polynomial p can be written as p ( x ) = ∏ ( x − r o o t s ) . what polynomial has roots w? the cyclotomic polynomial . we are just searching for − lo g 2 ( 2 1 4 4 0 Φ 2 0 1 5 ( 1 ) ) = 1 4 4 0 − lo g 2 ( Φ 2 0 1 5 ( 1 ) ) the formula for Φ n ( 1 ) = e Λ ( n ) for n≠1, and Λ ( n ) being the von magoldt function .proof in the comments. so, 1 4 4 0 − lo g 2 ( e 2 Λ ( 2 0 1 5 ) ) = 1 4 4 0 − lo g 2 ( 1 ) = 1 4 4 0
consider the basic x n − 1 = ∏ d ∣ n Φ d ( x ) divide by Φ 1 ( x ) = x − 1 . x n − 1 + x n − 2 + . . . + x + 1 = ∏ d ∣ n , d > 1 Φ d ( x ) put x=1 and take log ln ( n ) = ∑ d ∣ n , d > 1 ln ( Φ d ( 1 ) ) let f ( n ) = { 0 ln ( Φ d ( 1 ) ) , n ≤ 1 , n ≥ 2 .and p ( n ) = ln ( n ) .then in dirichlet convolution form: p = f ∗ u . convolute both sides with μ to get: p ∗ μ = f ∗ I = f . in other words: ln ( Φ n ( 1 ) ) = ∑ d ∣ n ln ( d ) μ ( d n ) it is well known: ln ( n ) = ∑ d ∣ n Λ ( n ) this is easy to prove, try it yourself. in dirichlet convolution form this is: p = Λ ∗ u . convolute bothsides with μ to get: p ∗ μ = Λ ∗ I = Λ . in other words ∑ d ∣ n ln ( d ) μ ( d n ) = Λ ( n ) . we get that ln ( Φ n ( 1 ) ) = Λ ( n ) or Φ n ( 1 ) = e Λ ( n ) . we are done □ .
Yes, very nice! (+1) You are good!
Small typo: the final answer is 1440.
Problem Loading...
Note Loading...
Set Loading...
The solution I had in mind is essentially the same as Aareyan's, with some small variants.
Lemma: Φ 2 0 1 5 ( 1 ) = ∏ ( 1 − ω ) = 1 , where the product is taken over all primitive 2015th roots of unity ω .
Proof of lemma: Note that Φ p ( 1 ) = p for prime p . Now we show by induction that Φ n ( 1 ) = 1 for square-free n = p 1 ∗ . . . ∗ p m with m > 1 . We write x n − 1 = ∏ d ∣ n Φ d ( x ) , divide by x − 1 , and evaluate at x = 1 to see that n = p 1 ∗ . . . ∗ p m ∗ Φ n ( 1 ) so Φ n ( 1 ) = 1 and, in particular, Φ 2 0 1 5 ( 1 ) = 1 .
Thus we have ∏ ( 1 − ω ) = 1 , and taking conjugates, ∏ ( 1 − ω ) ˉ = 1 so 1 = ∏ ( 1 − ω ) ( 1 − ω ) ˉ = ∏ k 2 ( 1 − cos ( 2 k π / 2 0 1 5 ) ) = 2 ϕ ( 2 0 1 5 ) ∏ k ( 1 − cos ( 2 π k / 2 0 1 5 )), where the products are taken over all 1 ≤ k ≤ 2 0 1 5 with g cd ( 1 , 2 0 1 5 ) = 1 . Taking logarithms to base 2, we find that S = ϕ ( 2 0 1 5 ) = 1 4 4 0