If you evaluate , you'll get a sum of different powers of 's multiplied by different coefficients.
What is the highest exponent of you will encounter in the evaluation of the integral, assuming the evaluation you get is in exact form, and that you leave everything expanded with no factoring of any kind done? Enter this exponent as your answer.
Bonus question : How could this be generalized? What happens if you do this with cosine? Why does this work?
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.
by tabular integration,we can notice a pattern
∫ x n sin ( x ) = c o s ( x ) k = 0 ∑ ⌊ 2 n ⌋ ( − 1 ) k + 1 ( n − 2 r ) ! n ! x n − 2 k + sin ( x ) k = 0 ∑ ⌊ 2 n − 1 ⌋ ( − 1 ) k ( n − 2 k − 1 ) ! n ! x n − 2 k − 1
evaluating the integral at x= 2 π we get the highest power is from the second sum which is 2016-1= 2 0 1 5 then evaluating it at x=0 we get 0 since x is in both sums it zeros every term in the sum so the answer is
2 0 1 5
nice problem!
Bonus :
we can derive the general formula for cosine using the same method
it is
∫ x n cos ( x ) d x = sin ( x ) i = 0 ∑ ⌊ 2 n ⌋ ( − 1 ) i ( n − 2 i ) ! n ! x m − 2 i + cos ( x ) i = 0 ∑ ⌊ 2 n − 1 ⌋ ( − 1 ) i ( n − 2 i − 1 ) ! n ! x n − 1 − 2 i
so in this case the highest power is 2016,or generally, n
this works because of integration by parts.I think that there may be a combinatoric explanation since i see factorials and even more so ,i think that there may be a geometrical interpretation.If anyone wants to do another approach,that would be awesome because i am eager to see it :)