Evaluating the sum $sumlimits_k=0^15 (-1)^k cos^560 (kpi/16).$

Clash Royale CLAN TAG#URR8PPP
up vote
4
down vote
favorite
To eliminate the pesky $(-1)^k$ term, I have rewritten this as
$ S = -sumlimits_k=0^15 cos^560 (kpi/16) + 2sumlimits_k=0^7 cos^560 (kpi/8).$
However, neither of these sums are easy to evaluate. I think that the next step would be finding the minimal polynomial of $1, cos(pi/8), dots, cos(7pi/8).$ However, this is just a factor of $T_16(x)-1$ where $T_n(x)$ is the $n$th degree Chebyshev Polynomial. This route is clearly messy before we even start factoring. The other sum would be even worse to handle.
I'm wondering if there are any other approaches for computing $S.$
combinatorics trigonometry summation
 |Â
show 2 more comments
up vote
4
down vote
favorite
To eliminate the pesky $(-1)^k$ term, I have rewritten this as
$ S = -sumlimits_k=0^15 cos^560 (kpi/16) + 2sumlimits_k=0^7 cos^560 (kpi/8).$
However, neither of these sums are easy to evaluate. I think that the next step would be finding the minimal polynomial of $1, cos(pi/8), dots, cos(7pi/8).$ However, this is just a factor of $T_16(x)-1$ where $T_n(x)$ is the $n$th degree Chebyshev Polynomial. This route is clearly messy before we even start factoring. The other sum would be even worse to handle.
I'm wondering if there are any other approaches for computing $S.$
combinatorics trigonometry summation
I can't accurately tell but I sense some use of Binomial theorem and complex numbers (Using De'Moivre's formula) to solve. But still it's just a guess :-))
â Manthanein
Aug 28 at 13:15
1
Seems De Moivre is applicable, but the computation is still "gruesome"â¦
â xbh
Aug 28 at 13:18
@xbh I have already thought about this. Unfortunately, $Re(z)^560 ne Re(z^560),$ so I cannot just perform calculations with complex numbers and take the real part to finish off.
â Display name
Aug 28 at 14:28
On second thought, I now see what you meant, and I agree that it will be ugly.
â Display name
Aug 28 at 14:31
2
This looks like it's related to math.stackexchange.com/q/2879650/5676
â Peter Taylor
Aug 28 at 16:18
 |Â
show 2 more comments
up vote
4
down vote
favorite
up vote
4
down vote
favorite
To eliminate the pesky $(-1)^k$ term, I have rewritten this as
$ S = -sumlimits_k=0^15 cos^560 (kpi/16) + 2sumlimits_k=0^7 cos^560 (kpi/8).$
However, neither of these sums are easy to evaluate. I think that the next step would be finding the minimal polynomial of $1, cos(pi/8), dots, cos(7pi/8).$ However, this is just a factor of $T_16(x)-1$ where $T_n(x)$ is the $n$th degree Chebyshev Polynomial. This route is clearly messy before we even start factoring. The other sum would be even worse to handle.
I'm wondering if there are any other approaches for computing $S.$
combinatorics trigonometry summation
To eliminate the pesky $(-1)^k$ term, I have rewritten this as
$ S = -sumlimits_k=0^15 cos^560 (kpi/16) + 2sumlimits_k=0^7 cos^560 (kpi/8).$
However, neither of these sums are easy to evaluate. I think that the next step would be finding the minimal polynomial of $1, cos(pi/8), dots, cos(7pi/8).$ However, this is just a factor of $T_16(x)-1$ where $T_n(x)$ is the $n$th degree Chebyshev Polynomial. This route is clearly messy before we even start factoring. The other sum would be even worse to handle.
I'm wondering if there are any other approaches for computing $S.$
combinatorics trigonometry summation
edited Aug 28 at 12:26
asked Aug 28 at 12:13
Display name
669211
669211
I can't accurately tell but I sense some use of Binomial theorem and complex numbers (Using De'Moivre's formula) to solve. But still it's just a guess :-))
â Manthanein
Aug 28 at 13:15
1
Seems De Moivre is applicable, but the computation is still "gruesome"â¦
â xbh
Aug 28 at 13:18
@xbh I have already thought about this. Unfortunately, $Re(z)^560 ne Re(z^560),$ so I cannot just perform calculations with complex numbers and take the real part to finish off.
â Display name
Aug 28 at 14:28
On second thought, I now see what you meant, and I agree that it will be ugly.
â Display name
Aug 28 at 14:31
2
This looks like it's related to math.stackexchange.com/q/2879650/5676
â Peter Taylor
Aug 28 at 16:18
 |Â
show 2 more comments
I can't accurately tell but I sense some use of Binomial theorem and complex numbers (Using De'Moivre's formula) to solve. But still it's just a guess :-))
â Manthanein
Aug 28 at 13:15
1
Seems De Moivre is applicable, but the computation is still "gruesome"â¦
â xbh
Aug 28 at 13:18
@xbh I have already thought about this. Unfortunately, $Re(z)^560 ne Re(z^560),$ so I cannot just perform calculations with complex numbers and take the real part to finish off.
â Display name
Aug 28 at 14:28
On second thought, I now see what you meant, and I agree that it will be ugly.
â Display name
Aug 28 at 14:31
2
This looks like it's related to math.stackexchange.com/q/2879650/5676
â Peter Taylor
Aug 28 at 16:18
I can't accurately tell but I sense some use of Binomial theorem and complex numbers (Using De'Moivre's formula) to solve. But still it's just a guess :-))
â Manthanein
Aug 28 at 13:15
I can't accurately tell but I sense some use of Binomial theorem and complex numbers (Using De'Moivre's formula) to solve. But still it's just a guess :-))
â Manthanein
Aug 28 at 13:15
1
1
Seems De Moivre is applicable, but the computation is still "gruesome"â¦
â xbh
Aug 28 at 13:18
Seems De Moivre is applicable, but the computation is still "gruesome"â¦
â xbh
Aug 28 at 13:18
@xbh I have already thought about this. Unfortunately, $Re(z)^560 ne Re(z^560),$ so I cannot just perform calculations with complex numbers and take the real part to finish off.
â Display name
Aug 28 at 14:28
@xbh I have already thought about this. Unfortunately, $Re(z)^560 ne Re(z^560),$ so I cannot just perform calculations with complex numbers and take the real part to finish off.
â Display name
Aug 28 at 14:28
On second thought, I now see what you meant, and I agree that it will be ugly.
â Display name
Aug 28 at 14:31
On second thought, I now see what you meant, and I agree that it will be ugly.
â Display name
Aug 28 at 14:31
2
2
This looks like it's related to math.stackexchange.com/q/2879650/5676
â Peter Taylor
Aug 28 at 16:18
This looks like it's related to math.stackexchange.com/q/2879650/5676
â Peter Taylor
Aug 28 at 16:18
 |Â
show 2 more comments
2 Answers
2
active
oldest
votes
up vote
0
down vote
A note.
Just a simple estimate.
For $,ninmathbbN,$ itâÂÂs $,,displaystyle sumlimits_k=0^15 (-1)^k left(cosfrackpi16right)^2n = 1 â 2 sumlimits_k=1^7 (-1)^k-1 left(cosfrackpi16right)^2n,$ .
Because of $displaystyleenspace k=1..6 : enspace 0 < cosfrac(k+1)pi16 < cosfrackpi16 < 1enspace$ we have
$displaystyle left(cosfracpi16right)^2n - left(cosfracpi8right)^2n < sumlimits_k=1^7 (-1)^k-1 left(cosfrackpi16right)^2n < left(cosfracpi16right)^2n $
and therefore
$,displaystyle 1 â 2 left(cosfracpi16right)^2n < sumlimits_k=0^15 (-1)^k left(cosfrackpi16right)^2n < 1 â 2left(left(cosfracpi16right)^2n - left(cosfracpi8right)^2nright) ,,$ .
It goes to $,1,$ for large $,n,$ but it isn't, it's a bit smaller.
add a comment |Â
up vote
0
down vote
Let us compute the number using sage, the needed two lines
K.<z> = CyclotomicField( 32 )
print sum( [ (-1)^k * ( (z^k + z^-k) / 2 )^560 for k in [0..15] ] )
will be slightly expanded, so that the human eye can easily digest them, above z is $zeta_32simexp(2pi i/32)$ a primitive root of unity of order $32$, sage works algebraically (exactly), the (also by sage) preferred embedding in $Bbb C$ can be easily changed:
sage: K.<z> = CyclotomicField( 32 )
sage: z.complex_embedding()
0.980785280403230 + 0.195090322016128*I
sage: cos(2*pi/32).n()
0.980785280403230
sage: A = sum( [ (-1)^k * ( (z^k + z^-k) / 2 )^560 for k in [0..15] ] )
sage: A = QQ(A)
sage: A.denom().factor()
2^487
sage: A.numer()
399568537235075894687625168713672502385259077051830433046200439695346621697198388130048600447044762506823601999970295738124406324872353832659479279
This writes the given sum as a rational number with denominator $2^487$ and a numerator as above. (Do we expect something special about this number, expected to be rational with a two-power as denominator?!)
I knew that $2^560S$ had to be an integer before I started solving the problem, which explains your result.
â Display name
Aug 28 at 19:19
add a comment |Â
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
A note.
Just a simple estimate.
For $,ninmathbbN,$ itâÂÂs $,,displaystyle sumlimits_k=0^15 (-1)^k left(cosfrackpi16right)^2n = 1 â 2 sumlimits_k=1^7 (-1)^k-1 left(cosfrackpi16right)^2n,$ .
Because of $displaystyleenspace k=1..6 : enspace 0 < cosfrac(k+1)pi16 < cosfrackpi16 < 1enspace$ we have
$displaystyle left(cosfracpi16right)^2n - left(cosfracpi8right)^2n < sumlimits_k=1^7 (-1)^k-1 left(cosfrackpi16right)^2n < left(cosfracpi16right)^2n $
and therefore
$,displaystyle 1 â 2 left(cosfracpi16right)^2n < sumlimits_k=0^15 (-1)^k left(cosfrackpi16right)^2n < 1 â 2left(left(cosfracpi16right)^2n - left(cosfracpi8right)^2nright) ,,$ .
It goes to $,1,$ for large $,n,$ but it isn't, it's a bit smaller.
add a comment |Â
up vote
0
down vote
A note.
Just a simple estimate.
For $,ninmathbbN,$ itâÂÂs $,,displaystyle sumlimits_k=0^15 (-1)^k left(cosfrackpi16right)^2n = 1 â 2 sumlimits_k=1^7 (-1)^k-1 left(cosfrackpi16right)^2n,$ .
Because of $displaystyleenspace k=1..6 : enspace 0 < cosfrac(k+1)pi16 < cosfrackpi16 < 1enspace$ we have
$displaystyle left(cosfracpi16right)^2n - left(cosfracpi8right)^2n < sumlimits_k=1^7 (-1)^k-1 left(cosfrackpi16right)^2n < left(cosfracpi16right)^2n $
and therefore
$,displaystyle 1 â 2 left(cosfracpi16right)^2n < sumlimits_k=0^15 (-1)^k left(cosfrackpi16right)^2n < 1 â 2left(left(cosfracpi16right)^2n - left(cosfracpi8right)^2nright) ,,$ .
It goes to $,1,$ for large $,n,$ but it isn't, it's a bit smaller.
add a comment |Â
up vote
0
down vote
up vote
0
down vote
A note.
Just a simple estimate.
For $,ninmathbbN,$ itâÂÂs $,,displaystyle sumlimits_k=0^15 (-1)^k left(cosfrackpi16right)^2n = 1 â 2 sumlimits_k=1^7 (-1)^k-1 left(cosfrackpi16right)^2n,$ .
Because of $displaystyleenspace k=1..6 : enspace 0 < cosfrac(k+1)pi16 < cosfrackpi16 < 1enspace$ we have
$displaystyle left(cosfracpi16right)^2n - left(cosfracpi8right)^2n < sumlimits_k=1^7 (-1)^k-1 left(cosfrackpi16right)^2n < left(cosfracpi16right)^2n $
and therefore
$,displaystyle 1 â 2 left(cosfracpi16right)^2n < sumlimits_k=0^15 (-1)^k left(cosfrackpi16right)^2n < 1 â 2left(left(cosfracpi16right)^2n - left(cosfracpi8right)^2nright) ,,$ .
It goes to $,1,$ for large $,n,$ but it isn't, it's a bit smaller.
A note.
Just a simple estimate.
For $,ninmathbbN,$ itâÂÂs $,,displaystyle sumlimits_k=0^15 (-1)^k left(cosfrackpi16right)^2n = 1 â 2 sumlimits_k=1^7 (-1)^k-1 left(cosfrackpi16right)^2n,$ .
Because of $displaystyleenspace k=1..6 : enspace 0 < cosfrac(k+1)pi16 < cosfrackpi16 < 1enspace$ we have
$displaystyle left(cosfracpi16right)^2n - left(cosfracpi8right)^2n < sumlimits_k=1^7 (-1)^k-1 left(cosfrackpi16right)^2n < left(cosfracpi16right)^2n $
and therefore
$,displaystyle 1 â 2 left(cosfracpi16right)^2n < sumlimits_k=0^15 (-1)^k left(cosfrackpi16right)^2n < 1 â 2left(left(cosfracpi16right)^2n - left(cosfracpi8right)^2nright) ,,$ .
It goes to $,1,$ for large $,n,$ but it isn't, it's a bit smaller.
edited Aug 28 at 13:43
answered Aug 28 at 13:30
user90369
7,891925
7,891925
add a comment |Â
add a comment |Â
up vote
0
down vote
Let us compute the number using sage, the needed two lines
K.<z> = CyclotomicField( 32 )
print sum( [ (-1)^k * ( (z^k + z^-k) / 2 )^560 for k in [0..15] ] )
will be slightly expanded, so that the human eye can easily digest them, above z is $zeta_32simexp(2pi i/32)$ a primitive root of unity of order $32$, sage works algebraically (exactly), the (also by sage) preferred embedding in $Bbb C$ can be easily changed:
sage: K.<z> = CyclotomicField( 32 )
sage: z.complex_embedding()
0.980785280403230 + 0.195090322016128*I
sage: cos(2*pi/32).n()
0.980785280403230
sage: A = sum( [ (-1)^k * ( (z^k + z^-k) / 2 )^560 for k in [0..15] ] )
sage: A = QQ(A)
sage: A.denom().factor()
2^487
sage: A.numer()
399568537235075894687625168713672502385259077051830433046200439695346621697198388130048600447044762506823601999970295738124406324872353832659479279
This writes the given sum as a rational number with denominator $2^487$ and a numerator as above. (Do we expect something special about this number, expected to be rational with a two-power as denominator?!)
I knew that $2^560S$ had to be an integer before I started solving the problem, which explains your result.
â Display name
Aug 28 at 19:19
add a comment |Â
up vote
0
down vote
Let us compute the number using sage, the needed two lines
K.<z> = CyclotomicField( 32 )
print sum( [ (-1)^k * ( (z^k + z^-k) / 2 )^560 for k in [0..15] ] )
will be slightly expanded, so that the human eye can easily digest them, above z is $zeta_32simexp(2pi i/32)$ a primitive root of unity of order $32$, sage works algebraically (exactly), the (also by sage) preferred embedding in $Bbb C$ can be easily changed:
sage: K.<z> = CyclotomicField( 32 )
sage: z.complex_embedding()
0.980785280403230 + 0.195090322016128*I
sage: cos(2*pi/32).n()
0.980785280403230
sage: A = sum( [ (-1)^k * ( (z^k + z^-k) / 2 )^560 for k in [0..15] ] )
sage: A = QQ(A)
sage: A.denom().factor()
2^487
sage: A.numer()
399568537235075894687625168713672502385259077051830433046200439695346621697198388130048600447044762506823601999970295738124406324872353832659479279
This writes the given sum as a rational number with denominator $2^487$ and a numerator as above. (Do we expect something special about this number, expected to be rational with a two-power as denominator?!)
I knew that $2^560S$ had to be an integer before I started solving the problem, which explains your result.
â Display name
Aug 28 at 19:19
add a comment |Â
up vote
0
down vote
up vote
0
down vote
Let us compute the number using sage, the needed two lines
K.<z> = CyclotomicField( 32 )
print sum( [ (-1)^k * ( (z^k + z^-k) / 2 )^560 for k in [0..15] ] )
will be slightly expanded, so that the human eye can easily digest them, above z is $zeta_32simexp(2pi i/32)$ a primitive root of unity of order $32$, sage works algebraically (exactly), the (also by sage) preferred embedding in $Bbb C$ can be easily changed:
sage: K.<z> = CyclotomicField( 32 )
sage: z.complex_embedding()
0.980785280403230 + 0.195090322016128*I
sage: cos(2*pi/32).n()
0.980785280403230
sage: A = sum( [ (-1)^k * ( (z^k + z^-k) / 2 )^560 for k in [0..15] ] )
sage: A = QQ(A)
sage: A.denom().factor()
2^487
sage: A.numer()
399568537235075894687625168713672502385259077051830433046200439695346621697198388130048600447044762506823601999970295738124406324872353832659479279
This writes the given sum as a rational number with denominator $2^487$ and a numerator as above. (Do we expect something special about this number, expected to be rational with a two-power as denominator?!)
Let us compute the number using sage, the needed two lines
K.<z> = CyclotomicField( 32 )
print sum( [ (-1)^k * ( (z^k + z^-k) / 2 )^560 for k in [0..15] ] )
will be slightly expanded, so that the human eye can easily digest them, above z is $zeta_32simexp(2pi i/32)$ a primitive root of unity of order $32$, sage works algebraically (exactly), the (also by sage) preferred embedding in $Bbb C$ can be easily changed:
sage: K.<z> = CyclotomicField( 32 )
sage: z.complex_embedding()
0.980785280403230 + 0.195090322016128*I
sage: cos(2*pi/32).n()
0.980785280403230
sage: A = sum( [ (-1)^k * ( (z^k + z^-k) / 2 )^560 for k in [0..15] ] )
sage: A = QQ(A)
sage: A.denom().factor()
2^487
sage: A.numer()
399568537235075894687625168713672502385259077051830433046200439695346621697198388130048600447044762506823601999970295738124406324872353832659479279
This writes the given sum as a rational number with denominator $2^487$ and a numerator as above. (Do we expect something special about this number, expected to be rational with a two-power as denominator?!)
answered Aug 28 at 18:42
dan_fulea
4,5851211
4,5851211
I knew that $2^560S$ had to be an integer before I started solving the problem, which explains your result.
â Display name
Aug 28 at 19:19
add a comment |Â
I knew that $2^560S$ had to be an integer before I started solving the problem, which explains your result.
â Display name
Aug 28 at 19:19
I knew that $2^560S$ had to be an integer before I started solving the problem, which explains your result.
â Display name
Aug 28 at 19:19
I knew that $2^560S$ had to be an integer before I started solving the problem, which explains your result.
â Display name
Aug 28 at 19:19
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2897192%2fevaluating-the-sum-sum-limits-k-015-1k-cos560-k-pi-16%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
I can't accurately tell but I sense some use of Binomial theorem and complex numbers (Using De'Moivre's formula) to solve. But still it's just a guess :-))
â Manthanein
Aug 28 at 13:15
1
Seems De Moivre is applicable, but the computation is still "gruesome"â¦
â xbh
Aug 28 at 13:18
@xbh I have already thought about this. Unfortunately, $Re(z)^560 ne Re(z^560),$ so I cannot just perform calculations with complex numbers and take the real part to finish off.
â Display name
Aug 28 at 14:28
On second thought, I now see what you meant, and I agree that it will be ugly.
â Display name
Aug 28 at 14:31
2
This looks like it's related to math.stackexchange.com/q/2879650/5676
â Peter Taylor
Aug 28 at 16:18