Prove thatsin(n+12)×cos(n2)sin(12)≥n2
So far I've switched up the problem and gotten it down to all sin functions. I have sin(2n+12)+sin(12)2sin(12)≥n2
So far this is the farthest I've got that seems to make sense. I graph the function each time I do it to make sure that the move I made was a legal move. From the graph I can see that the graph has a maximum at 1.5429
So am I going to have to use induction to prove this statement? or am I going about this all the wrong way?
Answer
look: 1sin(12)≥sin(n+12)⋅cos(n2)sin(12)≥n2
so:
1sin(12)≥n2⟺n≤2sin(12)≈4.2
that can easily be falsified by choosing an n suffieciently large (like 5 for example)
EDIT
to help you for your "ultimate goal":
n∑k=0|cos(k)|≥n2⟺2nn∑k=0|cos(k)|≥1
we can prove very easily that this new statement is true for sufficiently large n:
limn→+∞2nn∑k=0|cos(k)|=2(1π∫π2−π2|cos(x)| dx)=4π≥1(true)
to get that integral use this fact:
{n mod π | n∈N} is dense in ]0,π[
then use the definition of riemann sum and successively exploit the fact that cos(x) is a circular function
to give a complete proof you could use numerical calculations to prove that it works in 0≤n≤Nh then this other proof to show that above Nh it also works
No comments:
Post a Comment