Professional Documents
Culture Documents
Mathematical Induction - 2014 To 2006 PDF
Mathematical Induction - 2014 To 2006 PDF
au page 1
Mathematical Induction
14 13 Use mathematical induction to prove that 2n + (–1)n+1 is divisible by 3 for all 3 Solution
a integers n 1.
13 14 Solution
1 1 1 1
(i) Show that for k > 0, – + < 0.
a (k 1) 2 k k 1
(ii) Use mathematical induction to prove that for all integers n 2, 2
1 1 1 1 1
+ + +…+ <2– .
1 2
2 2
3 2
n 2 n
a
11 6a 3 Solution
Use mathematical induction to prove that, for n 1,
1
1 × 5 + 2 × 6 + 3 × 7 + … + n(n + 4) = n(n + 1)(2n + 13).
6
10 7a Prove by induction that 47n + 53 × 147n–1 is divisible by 100 for all integers n 1. 3 Solution
09 7a d Solution
(i) Use differentiation from first principles to show that (x) = 1. 1
dx
(ii) Use mathematical induction and the product rule for differentiation to prove 2
d
that (xn) = nxn – 1 for all positive integers n.
dx
n
1 3 + 2 4 + 3 5 + … + n(n + 2) = (n + 1) (2n + 7).
6
07 4b Use mathematical induction to prove that, 72n–1 + 5 is divisible by 12, for all 3 Solution
integers n ≥1.
Solution
06 5d tan tan 1
(i) Use the fact that tan( – ) = to show that
1 tan tan
1 + tan n tan(n+1) = cot (tan(n+1) – tan n)
(ii) Use mathematical induction to prove that, for all integers n ≥ 1, 3
tan tan 2 + tan 2 tan 3 + … + tan n tan(n+1)
= – (n+1) + cot tan(n+1)
HSC exam papers © Board of Studies, Teaching and Educational Standards NSW for and on behalf of the Crown in right of State of NSW