Solution 1
We apply the identity
sinnsin(n+1)1=sin11⋅sinnsin(n+1)sin(n+1)cosn−sinncos(n+1)=sin11⋅(sinncosn−sin(n+1)cos(n+1))=sin11⋅(cotn−cot(n+1)).
The motivation for this identity arises from the need to decompose those fractions, possibly into telescoping.
Thus our summation becomes
k=23∑67sin(2k−1)sin2k1=sin11(cot45−cot46+cot47−⋯+cot133−cot134).
Since cot(180−x)=−cotx, the summation simply reduces to sin11⋅(cot45−cot90)=sin11−0=sin1∘1. Therefore, the answer is 001.
Solution 2
We can make an approximation by observing the following points:
The average term is around the 60's which gives 34.
There are 45 terms, so the approximate sum is 60.
Therefore, sin(n∘) equals approximately 601.
Recall that the approximation of sin(x) in radians is x if x is close to zero. In this case x is close to zero. Converting to radians we see that sin(1) in degrees is about sin571 in radians, or is about 571 because of the approximation. What we want is apparently close to that so we make the guess that n is equal to 1 degree. Basically, it boils down to the approximation of sin(1)=601 in degrees, convert to radians and use the small angle approximation sin(x)=x.
~edited for clarity by fermat_sLastAMC
Solution 3 (Alternate Finish)
Let S be the sum of the sequence. We begin the same as in Solution 1 to get Ssin(1)=cot(45)−cot(46)+cot(47)−cot(48)+...+cot(133)−cot(134). Observe that this "almost telescopes," if only we had some extra terms. Consider adding the sequence sin(46)sin(47)1+sin(48)sin(49)1+...+sin(134)sin(135)1. By the identity sin(x)=sin(180−x), this sequence is equal to the original one, simply written backwards. By the same logic as before, we may rewrite this sequence as Ssin(1)=cot(46)−cot(47)+cot(48)−cot(49)+...+cot(134)−cot(135), and when we add the two sequences, they telescope to give 2Ssin(1)=cot(45)−cot(135)=2. Hence, S=sin(1∘)1, and our angle is 001.
~keeper1098
Solution 4
First, multiply sinn∘ on both sides.
sinm∘sin(m+1)∘sinn∘=sinm∘sin(m+1)∘sin(k+n−k)∘=sinm∘sin(m+1)∘sin(k+n)∘cosk∘−sink∘cos(k+n)∘
Let k=m since k is could be any number.
sinm∘sin(m+1)∘sin(k+n)∘cosk∘−sinm∘sin(m+1)∘sink∘cos(k+n)∘=sinm∘sin(m+1)∘sin(m+n)∘cosm∘−sinm∘sin(m+1)∘sinm∘cos(m+n)∘
Lemma
Proof
=sinm∘sin(m+1)∘sin(m+1)∘cosm∘−sinm∘sin(m+1)∘sinm∘cos(m+1)∘=sinm∘cosm∘−sin(m+1)∘cos(m+1)∘=cotm∘−cot(m+1)∘
The sum of all numbers could be written. Moreover, notice that cotα+cotβ=0 if α+β=180∘.
cot45∘−cot46∘+cot47∘−cot48∘+⋯−cot132∘+cot133∘−cot134∘=(cot45∘+cot47∘+⋯+cot89∘+cot91∘+⋯+cot133∘)−(cot46∘+⋯+cot88∘+cot90∘+cot92∘+⋯+cot134∘)=cot45∘−cot90∘=1
Because 1=1, the lemma is true.
Q.E.D.
n could be 1. Moreover, there are no smaller positive integer less than 1 to test. Thus, the least positive integer n that satisfies the given condition is 001.
~MaPhyCom