Why do I insert 2015 anywhere I like? #1

Geometry Level 5

sec ( 2 π 2015 ) + sec ( 4 π 2015 ) + sec ( 6 π 2015 ) + + sec ( 2014 π 2015 ) = ? \large{\sec \left( \dfrac{2\pi}{2015} \right) + \sec \left( \dfrac{4\pi}{2015} \right) + \sec\left( \dfrac{6\pi}{2015} \right) + \ldots + \sec \left( \dfrac{2014\pi}{2015} \right) = \ ? }


Bonus : Generalize the sum k = 1 n sec ( 2 k π 2 n + 1 ) \displaystyle \sum_{k=1}^n \sec \left( \dfrac{2k\pi}{2n+1} \right) in terms of n n with a proper derivation without using methods like Induction.

Try it's sister problem: Why do I insert 2015 anywhere I like? #2


The answer is -1008.

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.

2 solutions

Let S = k = 1 ( n 1 ) / 2 sec ( 2 π k n ) S=\displaystyle \sum_{k=1}^{(n-1)/2} \sec\left(\dfrac{2\pi k}{n}\right) where n n is odd, w = e 2 π i / n w=e^{2 \pi i / n} , t = w + 1 / w = 2 cos ( 2 π n ) t=w+1/w=2\cos\left(\dfrac{2 \pi}{n}\right) and P k = w k + 1 / w k = 2 cos ( 2 π k n ) P_k=w^k+1/w^k=2\cos\left(\dfrac{2 \pi k}{n}\right) .

Factoring w n = 1 w^n=1 we obtain: w n 1 + w n 2 + + w + 1 = 0 w^{n-1}+w^{n-2}+\cdots+w+1=0 , then divide by w ( n 1 ) / 2 w^{(n-1)/2} : w ( n 1 ) / 2 + 1 / w ( n 1 ) / 2 + w ( n 3 ) / 2 + 1 / w ( n 3 ) / 2 + + w + 1 / w + 1 = 0 w^{(n-1)/2}+1/w^{(n-1)/2}+w^{(n-3)/2}+1/w^{(n-3)/2}+\cdots+w+1/w+1=0 .

That expression is also P ( n 1 ) / 2 + P ( n 3 ) / 2 + + P 1 + 1 = 0 P_{(n-1)/2}+P_{(n-3)/2}+\cdots+P_1+1=0 , which obviously factors as ( t 2 cos 2 π n ) ( t 2 cos 4 π n ) ( t 2 cos π ( n 1 ) n ) \left(t-2\cos \dfrac{2 \pi}{n}\right)\left(t-2\cos \dfrac{4 \pi}{n}\right)\cdots\left(t-2\cos \dfrac{\pi(n-1)}{n}\right)

Now, by Newton's sums we see that P 1 = t P_1=t , P 2 = t 2 2 P_2=t^2-2 and P k = t P k 1 P k 2 P_k=t P_{k-1}-P_{k-2} . We only want to know the coefficient of t t and the constant term, so we see that the last term of P k P_k is:

  • 2 ( 1 ) k / 2 2(-1)^{k/2} if k k is even
  • k ( 1 ) ( k 1 ) / 2 t k(-1)^{(k-1)/2}t if k k is odd

So, adding them:

+ ( 1 3 + 5 7 + ) n + 1 4 terms t + ( 2 + 2 2 + ) n 1 4 terms + 1 = 0 \cdots+\underbrace{(1-3+5-7+\cdots)}_{\left\lfloor \dfrac{n+1}{4} \right\rfloor \text{ terms}}t+\underbrace{(-2+2-2+\cdots)}_{\left\lfloor \dfrac{n-1}{4} \right\rfloor\text{ terms}}+1=0

By Vieta's formulas, S S is 2 × coefficient of t constant term -2\times\dfrac{\text{coefficient of t}}{\text{constant term}} :

S = 2 × 1 3 + 5 7 + ( 2 + 2 2 + ) + 1 S=-2\times\dfrac{1-3+5-7+\cdots}{(-2+2-2+\cdots)+1}

After adjusting it, we end up with S = 2 n + 1 4 ( 1 ) ( n 1 ) / 2 S=2\left\lfloor \dfrac{n+1}{4}\right\rfloor(-1)^{(n-1)/2}

In this problem n = 2015 n=2015 , so S = 1008 S=\boxed{-1008} .

Satyajit Mohanty
Aug 31, 2015

Let z = e i θ = x + i y z = e^{i\theta} = x+iy . Then:

cos ( ( 2 n + 1 ) θ ) = R e ( z 2 n + 1 ) = k = 0 n ( 2 n + 1 2 k ) x 2 ( n k ) + 1 ( i y ) 2 k \cos((2n+1)\theta) = Re(z^{2n+1}) = \displaystyle \sum_{k=0}^n \binom{2n+1}{2k} x^{2(n-k)+1} (iy)^{2k} = k = 0 n ( 1 ) k ( 2 n + 1 2 k ) x 2 ( n k ) + 1 ( 1 x 2 ) k = \displaystyle \sum_{k=0}^n (-1)^k \binom{2n+1}{2k} x^{2(n-k)+1} (1-x^2)^k

which we denote as f ( x ) f(x) . It's easy to see that:

f ( x ) = a 2 n + 1 x 2 n + 1 + + a 1 x 1 . . . ( 1 ) f(x) = a_{2n+1}x^{2n+1} + \ldots + a_1x^1 \quad ...(1)

where

a 1 = ( 1 ) n ( 2 n + 1 2 n ) = ( 1 ) n ( 2 n + 1 ) . . . ( 2 ) a_1 = (-1)^n \binom{2n+1}{2n} = (-1)^n (2n+1) \quad ...(2)

On the other hand, since cos ( ( 2 n + 1 ) θ ) = 1 2 ( z 2 n + 1 + 1 z 2 n + 1 ) = 1 + 1 2 ( z 2 n + 1 + 1 z 2 n + 1 2 ) \cos((2n+1)\theta) = \dfrac12 \left( z^{2n+1} + \dfrac{1}{z^{2n+1}} \right) = 1 + \dfrac12 \left( z^{2n+1} + \dfrac{1}{z^{2n+1}} -2 \right)

= 1 + 1 2 z 2 n + 1 ( z 2 n + 1 1 ) 2 = 1 + \dfrac{1}{2z^{2n+1}}(z^{2n+1} - 1)^2 and

( z 2 n + 1 1 ) 2 = k = 0 2 n ( z e 2 k π i 2 n + 1 ) 2 = k = 0 2 n ( z e 2 k π i 2 n + 1 ) ( z e 2 k π i 2 n + 1 ) (z^{2n+1} - 1)^2 = \displaystyle \prod_{k=0}^{2n} \left( z-e^{\frac{2k\pi i}{2n+1}} \right)^2 = \prod_{k=0}^{2n} \left(z-e^{\frac{2k\pi i}{2n+1}} \right) \left(z-e^{\frac{-2k\pi i}{2n+1}} \right)

= k = 0 2 n ( z 2 + 1 2 z cos ( 2 k π 2 n + 1 ) ) = \displaystyle \prod_{k=0}^{2n} \left( z^2 + 1 - 2z \cos \left( \dfrac{2k\pi}{2n+1} \right) \right)

We also have:

f ( x ) = 1 + 1 2 k = 0 2 n ( z + 1 z 2 cos ( 2 k π 2 n + 1 ) ) f(x) = 1 + \dfrac12 \prod_{k=0}^{2n} \left( z + \dfrac1z - 2 \cos \left( \dfrac{2k\pi}{2n+1} \right) \right)

= 1 + 2 2 n k = 0 2 n ( x 2 cos ( 2 k π 2 n + 1 ) ) . . . ( 3 ) = 1 + 2^{2n} \prod_{k=0}^{2n} \left( x - 2 \cos \left( \dfrac{2k\pi}{2n+1} \right) \right) \quad ...(3)

Now we compare the expressions ( 1 ) (1) and ( 3 ) (3) for f ( x ) f(x) . We see from ( 1 ) (1) that the constant term in ( 3 ) (3) is zero. Therefore:

2 2 n k = 0 2 n cos ( 2 k π 2 n + 1 ) = 1 2^{2n} \prod_{k=0}^{2n} \cos \left( \dfrac{2k\pi}{2n+1} \right) = 1

Comparing the coefficients of x x in ( 1 ) (1) and ( 3 ) (3) , and dividing by the product above (which equals 1), we get:

a 1 = k = 0 2 n sec ( 2 k π 2 n + 1 ) = 1 + 2 k = 1 n sec ( 2 k π 2 n + 1 ) a_1 = \sum_{k=0}^{2n} \sec \left(\dfrac{2k\pi}{2n+1}\right) = 1 + 2\sum_{k=1}^{n} \sec \left(\dfrac{2k\pi}{2n+1}\right)

Setting the above expression for a 1 a_1 equal to the expression in ( 2 ) (2) , we get:

k = 1 n sec ( 2 k π 2 n + 1 ) = ( 1 ) n ( 2 n + 1 ) 1 2 \sum_{k=1}^{n} \sec \left(\dfrac{2k\pi}{2n+1}\right) = \dfrac{(-1)^n(2n+1)-1}{2}

which equals n n if n n is even, and ( n + 1 ) -(n+1) if n n is odd.

Since our n n for the problem is n = 1007 n=1007 , and since it's odd, the answer is 1008 \boxed{-1008} .

Could u elaborate the fifth step from end

Deep seth - 5 years, 9 months ago

Log in to reply

In (1), the constant term in f(x) is zero as you can see. Therefore in (3) also the constant term of f(x) should be zero. That is it.

Satyajit Mohanty - 5 years, 9 months ago

How do you think of such good mathematics questions?

Department 8 - 5 years, 9 months ago

Log in to reply

Well I had solved such a problem for n = 3 n=3 . I thought to generalize it. Then, I extended n = 3 n=3 to n = 1007 n=1007 , and that's it.

Satyajit Mohanty - 5 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...