cos ( 8 ∘ ) + cos ( 1 6 ∘ ) + cos ( 3 2 ∘ ) + cos ( 5 6 ∘ ) + … + cos ( k ∘ ) + … + cos ( 3 5 2 ∘ ) Find the sum above, where 0 < k < 3 6 0 and g cd ( k , 3 6 0 ) = 8 .
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.
Wait... your formula assumes an arithmetic progression, but this isn't (we skip some terms)
Looks good! (+1) I'll enjoy the Harvard Commencement festivities today.... will write more in the evening
Challenge Master: Okay, I spotted my error and have amended them.
I don't have a mind-blowing solution, as Pi Han hoped for... just a simple counting argument, using the principle of inclusion/exclusion.
For a divisor d of 3 6 0 , we define S d = ∑ k = 1 3 6 0 / d cos ( k × d ∘ ) . Using roots of unity or symmetry, we see that S d = 0 for all d < 3 6 0 . Our sum is related to S 8 , but with the multiples of 2 4 ∘ and 4 0 ∘ omitted; thus we try S 8 − S 2 4 − S 4 0 . But now we are subtracting too much; the common multiples of 2 4 ∘ and 4 0 ∘ are subtracted twice. Since l c m ( 2 4 , 4 0 ) = 1 2 0 , we have to add S 1 2 0 to correct for this overcount ("inclusion/exclusion").Thus our sum is S 8 − S 2 4 − S 4 0 + S 1 2 0 = 0 .
One can write a very short solution in terms of primitive roots of unity and the Möbius Function μ ( n ) : Our sum is the sum of the primitive 4 5 -th roots of unity, which is μ ( 4 5 ) = 0 since 4 5 fails to be square-free.
The Mobius function approach is a nice way of thinking about this. It can be motivated because we want g cd ( 8 k ′ , 3 6 0 ) = 8 ⇔ g cd ( k ′ , 4 5 ) = 1 .
it could also be done by multiplying numerator and denominator by 2 sin θ and then continous product of 2 in both numerator and denominator
Problem Loading...
Note Loading...
Set Loading...
I will use these trigonometric identity repeatedly:
cos ( n 2 π ) + cos ( n 4 π ) + cos ( n 6 π ) + … + cos ( n ( n − 1 ) π ) = − 2 1 for all positive odd number n ≥ 3 .
And cos ( n π ) + cos ( n 3 π ) + cos ( n 5 π ) + … + cos ( n ( n − 2 ) π ) = − 2 1 for all positive odd number n ≥ 3 .
The sum becomes
W − W = = = = = = = gcd ( k , 4 5 ) = 1 ∑ 4 5 cos ( 4 5 k π ) k odd ∑ 4 3 cos ( 4 5 k π ) + k even ∑ 4 4 cos ( 4 5 k π ) − gcd ( k , 4 5 ) = 1 ∑ 4 5 cos ( 4 5 k π ) − gcd ( k , 4 5 ) = 1 ∑ 4 5 cos ( 4 5 k π ) gcd ( k , 4 5 ) = 3 ∑ 4 5 cos ( 4 5 k π ) + gcd ( k , 4 5 ) = 5 ∑ 4 5 cos ( 4 5 k π ) − gcd ( k , 4 5 ) = 1 5 ∑ 4 5 cos ( 4 5 k π ) gcd ( k , 1 5 ) = 1 ∑ 1 5 cos ( 1 5 k π ) + gcd ( k , 9 ) = 1 ∑ 5 cos ( 9 k π ) − gcd ( k , 3 ) = 1 ∑ 3 cos ( 3 k π ) gcd ( k , 1 5 ) = 1 ∑ 1 5 cos ( 1 5 k π ) + gcd ( k , 9 ) = 1 ∑ 5 cos ( 9 k π ) − k ∈ S 1 ∑ cos ( 1 5 k π ) − k ∈ S 2 ∑ cos ( 1 5 k π )
Where S = { 3 , 5 , 6 , 9 , 1 0 , 1 2 } , S 2 = { 3 , 6 } .
Apply cos ( A ) = − cos ( π − A ) and simplify everything, we get W = 0 .