Trig Challenge: Solutions to $\sin a \sin (2a) \sin (3a)$?

Click For Summary
SUMMARY

The equation $\sin a \sin (2a) \sin (3a) \cdots \sin (11a) \sin (12a) = 0$ has multiple solutions within the interval $(0, \pi]$. Each sine function contributes solutions at specific intervals, leading to a total count that can be determined through analysis of the individual sine terms. The discussion highlights the collaborative effort in solving the problem, with participants confirming similar approaches to the solution.

PREREQUISITES
  • Understanding of trigonometric functions and their properties
  • Familiarity with the concept of zeros of functions
  • Knowledge of the interval notation and its implications in calculus
  • Basic skills in solving equations involving sine functions
NEXT STEPS
  • Explore the periodicity of sine functions to determine their zeros
  • Learn about the graphical representation of trigonometric functions
  • Investigate the implications of multiple sine functions in product form
  • Study the behavior of sine functions in different intervals
USEFUL FOR

Mathematics students, educators, and anyone interested in solving trigonometric equations and understanding their solutions within specified intervals.

anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
How many solutions does the equation

$\sin a \sin (2a) \sin (3a) \cdots \sin (11a) \sin (12a) =0$

have in the interval $(0,\,\pi]$?
 
Mathematics news on Phys.org
It is clear that $a = \pi p/q$ for every fraction of the form $p / q$ with $1 \leq q \leq 12$, $0 < p \leq q$ is a solution to some product of the expression and hence a solution to the equation. Furthermore all solutions are of this form since $p/q \leq 1$. Hence the number of solutions to the expression is given by the length of the Farey sequence $F_{12}$ minus 1 (since it includes zero and we exclude it). Now we have:
$$\lvert F_1 \rvert = 2 ~ ~ ~ \text{and} ~ ~ ~ \lvert F_n \rvert = \lvert F_{n - 1} \rvert + \varphi(n)$$
Which gives us the general expression:
$$\lvert F_n \rvert = 1 + \sum_{m = 1}^n \varphi(m)$$
Therefore:
$$\lvert F_{12} \rvert = 1 + \varphi(1) + \varphi(2) + \cdots + \varphi(12)$$
Which gives:
$$\lvert F_{12} \rvert = 1 + 1 + 1 + 2 + 2 + 4 + 2 + 6 + 4 + 6 + 4 + 10 + 4 = 47$$
And therefore we conclude there are $46$ solutions to the original expression.
 
Well done, Bacterius! And thanks for participating!

The solution that I have is more or less the same as yours.:)
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
1
Views
992
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 10 ·
Replies
10
Views
3K
Replies
6
Views
3K