Home » Ask & Discuss » Mathematics. » Trignometry « Back to Discussion
Trignometry
This problem I have framed on my own and I am a novice at that. So please pardon me if its too easy or bugging!Solve the following system in for the case n is odd:\sec^2 \theta_2 + \sec \theta_2 \sec \theta_3 + \sec^2 \theta_3 = 1 \\ \\. \\ \\. \\ \\. \\ \\\sec^2 \theta_{n-1} + \sec \theta_{n-1} \sec \theta_n + \sec^2 \theta_n = 1 \\ \\\sec^2 \theta_n + \sec \theta_n \sec \theta_1 + \sec^2 \theta_1 = 1" src="http://alt1.artofproblemsolving.com/Forum/latexrender/pictures/2/9/7/297dc4fc8a6e47babf45a7a3134d08779e176a2d.gif" align="absMiddle" minmax_bound="true" />
Comments (5)
The idea is very straighforward.
Since
we must have 
So, if we start with supposing that
, we must have
which in turn implies
and so on till we obtain in the case when n is odd, 
A similar contradiction occurs if we start with the assumption that
. So no solutions exist.
Does this explain the big grin in my question?












??
First time any of my problems have lasted this long. Maybe I should have sent it to the JEE Coordination team instead