Define the sequence a 1 , a 2 , a 3 , … by a n = k = 1 ∑ n sin k , where k represents radian measure. Find the index of the 1 0 0 th term for which a n < 0 .
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.
finally able to solve it
Log in to reply
I'm really sorry for making it too lengthy. I just tried to include all the steps in details for everyone's understanding.
Log in to reply
your solution is nice
2
∗
π
=
7
4
4
.
S
o
o
n
c
e
i
n
2
∗
π
,
t
h
e
r
e
w
i
l
l
b
e
o
n
e
−
t
i
v
e
.
So in 44 radians, there would be 7, negatives.
For any cycle, the index at the start of 7 step cycle is 6 * 6+1=37 less that the end index.
Next cycle starts after 7 more indices. So between cycles the similarly located indices are 44 apart.
From the first index of the cycle, next is at 6 more indices, till third.
Between 3rd and four there are 7 more indices.
From the forth index of the cycle, next is at 6 more indices, till the last-7th.
First cycle starts with first negative at index 6. Thus the 7th negative is at index 43.
So to have 98 negative, we need 14 * 44-1=615 as index.
For next cycle 7 more. That is for 99 negative, the index is 615+7=622.\
For 100 negatives, the index is 622+6=
6
2
8
.
In short negative appear as follows.
At (6-12-18--25-31-37-43)--(50-56-62--69-75-81-87)--(94 to 131).......(572 to 615)--622-628
In a cycle first at n, then n+6, n+12, n+19, n+25, n=31, n+37
So 7 negatives at 43,..... 14 at 43+44=87,..... 21 at 87+44=131,..... 7n at n * 44-1.
The diffrance
2
∗
π
−
7
4
4
=
−
.
0
0
2
5
2
8
would have effect for very large indices
and there will have to be a correction from the above method.
\text{The index f(x) for x appearances of negative value, for x<2251 is as under.}\\ \color{#3D99F6}{f(x)=\ \left \lfloo \dfrac{44*x} 7 \rigrt \rfloor} \ \ \ \ -\ \left \lfloor \dfrac x {161} \ \rigrt \rfloor}\ \ \left \lfloor \dfrac x {511} \ \rigrt \rfloor}\ -\ \left \lfloor \dfrac x {970} \ \rigrt \rfloor}\ -\ \left \lfloor \dfrac x {1355} \ \rigrt \rfloor}\ -\ \left \lfloor \dfrac x {1665} \ \rigrt \rfloor}\ }
Problem Loading...
Note Loading...
Set Loading...
De Moiver's formula is widely used to calculate the summation however it is sometimes also calculated by using Telescopic summation method. Here its a version of the calculation using the telescopic method. a n = k = 1 ∑ n sin k = 2 1 csc ( 2 1 ) k = 1 ∑ n ( 2 s i n ( 2 1 ) sin ( 2 2 k ) ) = 2 1 csc ( 2 1 ) k = 1 ∑ n ( cos ( 2 2 k − 1 ) − cos ( 2 2 k + 1 ) ) = 2 1 csc ( 2 1 ) ⎝ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎛ cos ( 2 1 ) + = k = 1 ∑ n − 1 cos ( 2 2 k + 1 ) k = 2 ∑ n cos ( 2 2 k − 1 ) − k = 1 ∑ n − 1 cos ( 2 2 k + 1 ) − cos ( 2 2 n + 1 ) ⎠ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎞ = 2 1 csc ( 2 1 ) ( cos ( 2 1 ) − cos ( 2 2 n + 1 ) + k = 1 ∑ n − 1 cos ( 2 2 k + 1 ) − k = 1 ∑ n − 1 cos ( 2 2 k + 1 ) ) = 2 1 csc ( 2 1 ) ( cos ( 2 1 ) − cos ( 2 2 n + 1 ) ) now, a n < 0 implies 2 1 csc ( 2 1 ) ( cos ( 2 1 ) − cos ( 2 2 n + 1 ) ) < 0 ⇒ cos ( 2 2 n + 1 ) > cos ( 2 1 ) ⇒ 2co s 2 ( 4 2 n + 1 ) − 1 > 2co s 2 ( 4 1 ) − 1 ⇒ co s 2 ( 4 2 n + 1 ) > co s 2 ( 4 1 ) ⇒ sec 2 ( 4 2 n + 1 ) < sec 2 ( 4 1 ) ⇒ 1 + tan 2 ( 4 2 n + 1 ) < 1 + tan 2 ( 4 1 ) ⇒ tan 2 ( 4 2 n + 1 ) < tan 2 ( 4 1 ) ⇒ ∣ ∣ ∣ ∣ tan ( 4 2 n + 1 ) ∣ ∣ ∣ ∣ < tan ( 4 1 ) ⇒ − tan ( 4 1 ) < tan ( 4 2 n + 1 ) < tan ( 4 1 ) ⇒ tan ( m π − 4 1 ) < tan ( 4 2 n + 1 ) < tan ( m π + 4 1 ) , becasue tan ( x ) ≡ tan ( m π + x ) for all m ∈ Z ⇒ m π − 4 1 < 4 2 n + 1 < m π + 4 1 ⇒ 2 π m − 1 < n < 2 π m ⇒ n ∈ ( 2 π m − 1 , 2 π m ) Here,m represents the number of first m cyclies of the continuous function of 2 1 csc ( 2 1 ) ( cos ( 2 1 ) − cos ( 2 2 n + 1 ) ) and also the numer of first m negative terms of the sequence because there exists only 1 negative value of a n in each [ 2 π ( m − 1 ) , 2 π m ] Now,the length of the interval (2m π - 1,2m π ) is 1 indicating that only one integer value for n is possible in this interval . For m = 1 0 0 , n ∈ ( 6 2 7 . 3 1 . . . , 6 2 8 . 3 1 . . . ) and since n ∈ Z , n = 6 2 8