All solutions here are SUGGESTED. Mr. Teng will hold no liability for any errors. Comments are entirely personal opinions.
Let P(n) be the statement
Assume P(k) is true for some positive integers k,
To prove P(k+1) is true,
, P(k+1) is true.
Since P(1) is true, and P(k) is true P(k+1) is true, by mathematical induction, P(n) is true for all positive integers n.
This question was a difficult question and stunned many students that year. Partly due to the lack of exposure to the use of trigonometry in MI. Students should know that the formulas can be found in MF15. As for (ii), students must take note of the word “Hence” and think of using method of differences. The MI requires students to know how to find the product to sum and sum to product formulas using the MF15, which many students do not realise how to use.