Proof by mathematical induction Contents: A The process of induction B_ The principle of mathematical induction234 _ PROOF BY MATHEMATICAL INDUCTION (Chapter 10) OPENING PROBLEM Paseal’s triangle is named after the French mathematician Blaise Pascal ‘who recorded it in 1653 in his treatise Traité du triangle arithmétique. However, this triangle was studied ‘by mathematicians long before Pascal. Indian and Persian mathematicians used it in the 10th century, as did the Chinese mathematician Yang Hui in the 13th century. Yang Hui’s Triangle The first few rows of Pascal’s triangle are shown alongside. 1 row 0 1 1-—rowl Things to think about: 1 2 1-—r1ow2 ‘a. Find the sum of the numbers in: 1331 i row0 WH row row 2 ian W row3 v row, i ® m@ i 6 a © What do you suspect is the sum of the numbers in row n? 16 15 20 15 6 1 € Suppose your suggestion in b is true for the nth row of Pascal's triangle. i. Can you show that your suggestion must then be true for the (n+ 1)th row also? i How can we formally prove that your suggestion in b is correct? In this Chapter we consider another method of proof called mathematical induction. It is a common method for proving that an infinite collection of statements are all true. HISTORICAL NOTE The concept of mathematical induction has been used, probably independently, by numerous ‘mathematicians in history, such as Euler in his proof of the infinity of primes. The formalisation of mathematical induction or “complete induction” as a method of proof, began with the Sicilian mathematician Francesco Maurolico (1494 - 1575) and was extended by Pascal. [NNN THE Process oF mpucTion The process of formulating a general result from close examination of the simplest cases is called mathematical induction For example: the first positive even number is. 2=2x1 the second positive even number is 4=2% 2 the third positive even number is 6 = 23 the fourth positive even number is 8=2x4 and from these results we induce that “the nth positive even number is 2x n or 2n”,PROOF BY MATHEMATICAL INDUCTION (Chapter 10) 235 The statement that “the nth positive even number is 2n” is a summary of the observations of the simple cases n= 1, 2, 3,4 and is a statement which we believe is true. We call such a statement a conjecture or proposition, When we write a conjecture, it is important to state the values of the variables for which we believe the conjecture is true. For example: “the nth positive odd number is 2n—1 where n € Z*”, If we are making a conjecture about the sum or product of the first n terms of a sequence, we either use sum or produet notation. For example, for the arithmetic sequence tu, = 3n —1, we write: 4 4 © buy tits +t = Du =O (Bi— 1) (te may seem confusing using éas a ae ‘counter here, when we also use ¢ for 4 -v—1. However, this is commonly done, © uy X up x us x ue = [] a = TL Bi-1) | so we do ithere to help you practise. [S Emre Eran By examining the cases. +2, 3,4, make a conjecture about the sum of eee i: 1 1 4 yo Si= dhe det gh tds tay = Bate TF the conjecture is true then Sto00 From these results we conjecture that S,, eal for all ne Zt. TF EXERCISE 100 1. Copy and complete the conjecture: @ The nth term of the sequence 3,7, 11, 15, 19, a is for ne b The mth term of the sequence 25, 22, 19, 16, is for ne € The nth term of the sequence 8, 12, 18, 27, ... is for ne 2 Examine the following using substitutions like n= 1, 2, 3,4, .. Hence complete the proposition or conjecture. a 3">142n for b 11" ~1 is divisible by for © T"4+2 is divisible by for 8" — 3" is divisible by forEL Det By examining the cases 1 1,2, 3,4, make a conjecture about the sum. 1444124324... 4n x 21 1x2 Hi x21 14+2x2= 144 = 5=1x P41 Dix = 648x2= §412=17=2x 2841 fi “ é Dexa) a 174 4x8 17492 = 49 = 3x41 We conjecture that $7 x 2? =(n—1) x 2"+1 forall ne Zt ct Copy and complete each conjecture, then write it using sum or product notation: 24446484104 +2n= for U+2x M43 B44 x Alp tmxenl = for for for for for ‘n points are placed inside a triangle. ‘Non-interseeting line segments are drawn connecting the 3 vertices of the triangle and the points within it, to partition the given triangle into smaller triangles. AAA Draw the cases n=4 and Make a proposition concerning a ‘maximum number of triangles obtained in the general case.PROOF BY MATHEMATICAL INDUCTION (Chapter 10) 237 5 n points are placed around a circle so that n=l a= when Tine segments are drawn between every pair of the points, no three line segments intersect atthe same point inside the circle. We consider the number of regions formed within the circle. La a Draw the cases n=4 and n=5. 3, 4,5 to form a conjecture about the number of regions formed in b Use the cases n= the general case. € Draw the case n= 6, Do you still believe your conjecture? PROPOSITION NOTATION We use P,, to represent a proposition which is defined for every integer n where n >a, a € 2. ION For example, in the case of Example 1, our proposition Py, is: 1 1 1 meee fi Tx oeag eaten eae 1 We see tha: 6 Py is = Ta eis xa pea 1 “FP + eee eee eis Tat ia tid Ret Fe THE PRINCIPLE OF MATHEMATICAL INDUCTION ‘The principle of mathematical induction constitutes a formal proof that a particular proposition is true. Suppose Pp is a proposition which is defined for every integer n >a, a € Z. If P, is true, and if P41 is true whenever P, is true, then Py is true for all n >a. Suppose for a given proposition that Py is true. If we can show that Pyy1 is true whenever Ps is true, then the truth of P, implies that P3 is true, which implies that Ps is true, which implies that Py is true, and so on ‘One can liken the principle of mathematical induction to the domino effect. We imagine an infinite set of dominoes all lined up. Provided that: peo © the first domino topples to the right, and © the (k+1)th domino will topple if the kth domino topples, then given sufficient time, every domino will topple. This is why mathematical induction can be used to show that an infinite collection of statements P,, are all true.Example 3 Coie Prove that 4" +2 is divi ble by 3 for n EZ, n>0, by using: the binomial expansion of (1 +3)" the principle of mathematical induction. If n=0, 4"4+2=494+2=3 which is divisible by 3. 4° 42=(14+3)" +2 HT4 (1)94 (5) P+ (G) 4 + (SEH (V+! = 84 (G)3+ (5) + (5)9% pont aT (2)" =3(14 (7) + (2) + (5) 3 to + (21) 8? + (G) 8 where the contents of the brackets is an integer 4" +2 is divisible by 3. Py is: 4" +2 is divisible by 3. for n€Z, n>0. Proof: (By the principle of mathematical induetion) () If n=0, 4°42 x3 4 Phistrue. (2) If Py is true, then 4*+2=3A where A is an integer, and A> 1. Now 4*#142=446 42 (3A —2)+2 {using ,} 2A-B+2 24-6 =3(1A—2) where 4A—2 isan imteger as A € Z. Thus 4*+1 +2 is divisible by 3 if 4* +2 is divisible by 3 Since Py is tue, and P.1 is true whenever Pe is true, P, is true for all n€Z, n>0. {principle of mathematical induction} EXERCISE 10B Prove that 3" +1. is divisible by 2 for all integers nm > 0, by using: the binomial expansion of (1 +2)" the principle of mathematical induction, Prove that 6" —1 is divisible by 5 for all integers n> 0, by using the binomial expansion of (5+ 1)" the principle of mathematical induction, Use the principle of mathematical induction to prove that for all n € Z* ni 42n is divisible by 3 7" —1 is divisible by 3 8" — 3" is divisible by 5 7" — 4" —3" is divisible by 12 T!42 x4" is divisible by 3 ni} 4£3n? +2n is divisible by 6. Eno Cian Prove that 2"*? + 3%" is divisible by 5 for n€Z, n >0. Pais: 24243" is divisible by 5 for ne Z, n>0. Proof: (By the principle of mathematical induction) (1) If n=0, 24243 5. Po is true.(2) If Pe is true, then 2**? + 3% Now 20+1)+2 4 33+) 5A. where A is an integer. pee baa cee ase = 2x 2 427 x 3% =2[54—3%] +273 {using P.} =5x2A-2x 3% 497 x 3 = 5x 2A +25 x 3 =5(24+5x 3°") where 24+5 x 3% is an integer as A is an integer and k > 0. is an integer. Thus 2142 4.3864) js divisible by 5 whenever 2+? + 3% is divisible by 5 Since Pp is true, and P41 is true whenever P is true, Pp is true for all m€ Z, 20. {principle of mathematical induction} 4 Use the principle of mathematical induction to prove that for all n € Z* a 3?m44 _ 22 is divisible by 5 b 3x 5241 4 20"41 js divisible by 17. a -cy" is an odd number for all n € Z*. 5 Prove that 3 6 Attempt to prove the following incorrect statements using induction: an? +2 is divisible by 3 forall ne Zt. b 3" 44 is divisible by 7 for all integers m > 1 ¢ grt isible by 5 for all integers n > 0. EL 1+) Self Tutor | Prove that 2” y" has a factor (e—y) forall ne Zt. Py is: 2" —y" has a factor (x—y) forall ne Zt. Proof: (By the principle of mathematical induetion) () If n=1, 2!—y!=a—y which has (x —y) asa factor Py is true, (2) If Py is true, then ac —y* has a factor (x — 9). Now aft! —yft! =axat—yxy' (ak — yt) +2 x yk —y xy! =a(ct—y*) + yX(z—y) using this term this term has has factor (ey) factor (e —y) Thus «+? — +1 has a factor (®—y) whenever 2 —y* has a factor (2 —y). Since P, is true, and P,,1 is true whenever P, is true, Pp is true for all n€ Zt. {principle of mathematical induction}Use the principle of mathematical induction to prove that for all n € Z*: P41 4 2M has a factor («+ a) 2" —1 has a factor (x +1), Earn DST Prove that 124-2743? +... tn? = So = MOAVENAD fora ne zt. Find 12 +2? +374... + 1007, Pris 24243? +...+n? Beth forall ne Z Proof: (By the principle of mathematical induction) 1x2x3 () If n=1, LHS=1?=1 and RHS P, is true. (2) If Pe istrue for ke Z+, then 2) =P arta. te = Me ve Thus 1742743? 4...467+(k+1)? RESUS D E(k +1)? {using Pi} DOREY Eye 8 as 6 6 {common factors, b+ DIROk-+1) + 6(k + 1)) 6 (6+ 12K? + k4 6+6) Taeaaanico menEEaES (k+ 2K? + 7k+6) ¥ aeEo as (6+ Dk+2)(2K +3) — 6 — + MUe +1 + N+ 1+) 6 Since P, is true, and Pj... is true whenever Pg is true, P, istrue for all n Zt. {principle of mathematical induction} 100x101 x 201 Using Pigg 12+ 22-43? +... + 1002 2 350 Use the principle of mathematical induction to prove that the following propositions are true for all positive integers 1: = not) Suen mint nin) n(n +0)? 7 Prove that the sum of the first n. odd numbers is n? using, the sum of an arithmetic series formula the principle of mathematical induction.Prove that for all n © Z*: Yoo sont Wixwte(n—1 x2" 41 i A Yixst= 41Gn— s+) deo eo oe Prove that 5° a a Dwcpesy ea ral mene Pr is: forall ne Z*. +h De Proof: (By the principle of mathematical induction) 1a 1 1 () If n=1, LHS= = md RHS= =o o. Pris tne, (2) If Py is true, then > il 1 k Gera GE-DGEF2) OA 1 1 1 Now 3x5 toxe t+ Gongs | GeaDGETH) Fas ee 8 Re ueeraneee Lieeeasen maa Geepeessy {using Pe) Sauitcmnee sce 1 2 ~ WBkF (Car) > Gea nGRrs * (3) _ 82 + 542 ~ aes a+ 5) Bape seetez) etal) 2Sk--TGE +5 paar er 10 __ (+1) earned Since P, is true, and Pk, is true whenever Pi. is true, P, is tue for all n€Z*, {principle of mathematical induction} Prove that = 2 forall ne zt. meray wT 1 1 1 1 Henee find Toor + aa + exas +" * Sox 1 nines oes Prove that SETHI TS forall neat. Hence find + Sxaxt013° a Prove that Lx I+ 2x 24+3x B44 x A+. tn x nl = (n+ 1)! 1 forall n€Z*, where n! is the product of the first n positive integers. eon n__ (nytt : & Provethat 24223444. = MVD forall vez. veal FAT EtG tot ta = CEOS all ne © Hence find thesum 24+ 243444... 4 2 in rational form. atatats 0! 14 Prove that n+2(n—1)+3(n—-2)+...+(n—2)3+(n—-1)2+n pete for all integers n> 1. Hint: 1x642x54+3x444x345x24+6x1 =1x542x44+3x%344x245x14 (14243444546) 15 The nth term of the sequence 3, 4, 4... is given by un =a(4)" +6(4)", a Find the values of a and b. © Use the principle of mathematical induction to prove that the sum of the first n terms of this sequence is, Su (1-A) +a(t-f) tora vez Hence find the sum of the infini series. Eo Det A sequence is defined by ty =1 and tipj1=2un +1 forall ne Zt. Prove that u, =2"—1 forall ne Z*. Py ist if uy =1 and tiny) =2ty +1 forall ne Zt, then uy =2"—1 Proof: (By the principle of mathematical induction) () If n=1, m=2-1 P, is true. 2) If Pe is true, then us Now wey 2-1) +1 {using Pe} ae a4] oF *. Pea is also true. Since P, is true, and P41 is true whenever Pe is true, Pr, is true for all n €Z*. {principle of mathematical induction} 16 Use the principle of mathematical induction to prove these propositions: a Ifa sequence {un} is defined by my =5 and tys1 = uy +8n+5 forall ne Z*, then ty = 4? +n, © If the first term of a sequence is 1, and subsequent terms are defined by the recursion formula Ung = 2+ Buin, then tig = 2(3"-1) —1.PROOF BY MATHEMATICAL INDUCTION (Chapter 10) 243 © Ifa sequence is defined by uy =2 and tny1 =aaaD forall ne Zt, then up» Ifa sequence is defined by uy = 1 and uny1 = Un +(—1)"(n-+ 1)? forall ne Z*, then _ CD In(n +1) faraeeea eae Uy © Masequence {un} satisfies unex = > + then up, = —“*— forall ne Zt. rug #1 17. Use the principle of mathematical induction to prove that: 2 the sum of the first n terms in an arithmetic series with first term au; and common difference d (Qu; + (n= 1d) for all n © z+ b the sum of the first n terms in a geometric series with first term wy and common ratio r is a, r#1 forall ne Zt. 18 A sequence is defined by wy =1 and tnyy = ty +(2n-+1) forall ne Zt a By finding u, for n=2,3, and 4, conjecture a formula for tu, in terms of n only. b Prove that your conjecture is true using the principle of mathematical induction. € Find the value of uo. 1 + GirpaD , 8, and 4, conjecture a formula for ti, in terms of n only. 19 A sequence is defined by uy = $ and py = Un forall ne 2". @ By finding u, for n b Prove that your conjecture is true using the principle of mathematical induction. © Find the value of uso, 20 (24+ V3)"=A,+B,V3 forall ne Z*, where A, and B, are integers. a Find A, and By for n=1,2,3,and 4, b Without using induction, show that A, 7 =24y +3B, and Buy = Ay + 2Bp. € Calculate (Aq)? ~ 3(B,)* for n= 1, 2,3, and 4 and hence conjecture a result. Prove that your conjecture is true. 21 Sometimes, in order to prove the next inductive step, we require the previous nwo cases. Another form of the principle of mathematical induction is therefore: Suppose P,, is a proposition defined for all n € Z*. If P, and Py are true, and also P,2 is true whenever Pj, and Pj are true, then P, is true for all n € Zt. Use this form to prove that: @ Ifa sequence up, is defined by wu = 11, uy = 37, and tmy2 = 5tiny1 — Gy for all ne Zt, then um =5(3") — 2+! b If un =(3+ V5)" +(3— V5)" where ne Z*, then uy isa multiple of 2”. Hint: First find @ and b such that tn42 = atn41 + btin.Gzeo 4) Self Tutor Use the principle of mathematical induction to prove that: sinf(2n + 1)e] 2cos2r + 2cos dir + 2eos Gx +... + 2cos2nx = 1 forall ne 2+. Py ist 2eos2e + Roose + 2eos6r-+ + 2e0s2ne = APE 4 for all ne 24. () If n=1, LHS=2cos2x and Rus = 2% | __sin@@r-+2) =il = (2sier cose) cos.n + cos arsine Pa See coe) oR nO Be = 20s? x + cos 2x — 1 1 = (2cos? x — 1) + cos 2x =2eos2r 2. P, is true. Q) If Py iste, then 2cos2n + 2cosde + 2cos6r+.... + 2eos2kx = eos 2x + 2cos dar + 2cos Gr + .... + 200s 2ker + 2cos[2(k + 1x] = (ae eel ee 1) + Beosi2(k-+ 1)x] x (52) sin{(2k + 1x] +2sin-zcos[2(k + 1a] 1 2k + 1)e) + +2(k+ 12] +sinfr = 28+ 1x) {2sin Acos B = sin(A + B) +sin(A— B)} — Sin{(2k + 12) + sin{(2(k + 1) + 1a} + sin{~ nf(2(e +1) + 1) ~ sinker 194] +02), _ sinatra + sing a = sinf(2(k-+ 0) + Dal Since P, is true, and Pj... is true whenever Py is true, Pp is true for all n © Z*. {principle of mathematical induction} 22 a Simplify 1+ sina + sin? + sin? x +5 Find the sum of the infinite series 1+sinw +sin?x+sin'x+.... ¢ Find the value of « between 0 and 2m such that the series in b has sum 3,23° We know that 2sinrcosar = sin 2 a Show that: 1 2sinx(cosr + cos32) b Predict what the following would simplify to: 1 2sinan(cos.r + cos 3x + cos Sur + cos Tr) ii cosa +cos3r + cosSx +....+cos19 (10 terms) iil cosa + cosr +cosdr +... +cos{(2n—1)z]__ (n terms) li Qsin.r(cossr + cose + cos5r) = sin Gx € Use the principle of mathematical induction to prove that: sin2nd £086 + 60830 + 00859 Fn + cos(2n — 1) = SM forall ne Zt 24 a Use the principle of mathematical induction to prove that: sin + sin39 + sin58 +... + sin(2n —1)9 = +=225222 forall postive imegers m. + sin F + sina + sin % + sin 4 + sin, b Hence find the value of tsi 25 Use the principle of mathematical induction to prove that for all n € Z+ 1 L cot H cote provided x Ama sees i a Stang +Ftang+..+ tang = cote © cos? 8+ cos? 28 + cos? 30-+ 008748 + n+ 6082(n8) = $ [n+ 26 Use the principle of mathematical induction to prove: a. the binomial expansion (tyr =¥ (Naty! forall ne zt a b Fermat's Small Theorem “in? — n_ is divisible by p for any prime p and n € Z*”, Gre Prove that if «#1, then TG +e*")=G42)0 +040 +24)... +22") forall ne Zt. Py is: For r#1, [[ (1+2%* (+a\(1+22)(1 +a)... (La? ne Zt. Proof: (By the principle of mathematical induction) () If n=1, LH RHS = =lte as #1. P, is true. (2) If Py is true, then (1+2)(1+22)(1+24)....(1 ta?"Now (142)(1+27)(1+a4)....(1+a” )+a™) a (=) ey Since P, is true, and Pj. is true whenever Pe is true, Pp is true for all n€Z*. {principle of mathematical induction} 27. Use the principle of mathematical induction to prove that: + HOF) 0-20-02) (ea) abe ne me 1 1 1 1) nti ¢ © (1-3) (0-3) (0-3) (0-3) < SEE oral imopers n> 2, Prove that the product of n odd integers is odd for n> 2. H sinde From sin2r=2sinxcosr we observe that sin.rcosr = = a Prove that — sin cos.r cos 22 cos 4ar I sine-cosercos2r b Assuming the patter in a continues, simplify: i sinecosrcos2r cos 4z cos 8x sinrcosrcos2r....cos 320 Generalise the results from a and 6. Prove your generalisation using the principle of ‘mathematical induction, 30 Use the principle of mathematical induction to prove that: a (21+ 22+ + Zn)” ai tag ten taf forall n€Z* and complex 21, 22, © (c122.tn)" = ay%tgh ty forall ne Z* and complex 21, 22, 1 ay nite q (2")" = (2")" forall n€Z* and complex = Goa Cates Prove that 2-" < + forall me Zt Paist 2" <2 forall ne Zt Proof: (By the principle of mathematical induction) () If n=1, LHS=2-'=2 ond RHS=}=1 “Py, is true. Q) If Pk is tue, then 2-* <> for some k > 1{using Pap {k>1, 50 2k>k+1} Since P; is true, and P,,1 is true whenever Py is true, Py is true for all n€Z*t. {principle of mathematical induction} Use the principle of mathematical induction to prove that: 3" >1+2n for all integers n >0 n> 2” forall ne Z, n24 8" > n° forall ne Zt St < B41 forall neg Si 2" > Bn? +1 forall neZ*, n>8 (<1) 4 is always positive for all n ¢ Z* for 0 3. P,, is: A convex n-sided polygon has 4n(n—3) diagonals for all n > 3. Proof: (By the principle of mathematical induetion) (1) If n=3 we have a triangle with 0 diagonals, and $x3x0=0 Ps is true. (2) If Py is true, a convex k-sided polygon has }(k—3) diagonals. We label the vertices 1, 2,3, 4, 5, any R— 1, 5 pis and k+1 as an additional vertex. ‘ as 3 k2 2 ket 1 ‘ an ‘The number of diagonals when n= k+1 is the number of diagonals when n =k, + &—2(¢ l)+—the line from vertex 1 to Qe vertex was previously a side and is now a diagonal the number of diagonals from vertex k +1 to the vertices 2, 3, 4, 5, wu. k—1248 _ PROOF BY MATHEMATICAL INDUCTION (Chapter 10) the number of diagonals when n= k-+1 is k(k-3)4+k-1 process for Ba 3) 5, 6, 3k(k— 3) + 3(k-1) [k? — 3k + 2k — 2 = $[k? —k-2] =4(k+1)(b-2) 4k+1)(+ 1-3) Since Py is true, and Pj... is true whenever Py is true, Py, is true for all n> 3. {principle of mathematical induction} 33. Use the principle of mathematical induction to prove that: 2 If m straight lines are drawn on a plane such that each line intersects every other line and no three lines have a common point of intersection, then the plane n(n +1) divided into +1 regions. 'b If n points are placed inside a triangle, and non-intersecting lines are drawn connecting the 3 vertices of the triangle and the points within it to partition the triangle into smaller triangles, then the maximum number of triangles resulting is 2n +1. NVESTIGATION 1 This Investigation involves the principle of mathematical induction as well as concepts from sequences, series, and counting, The sequence of numbers {tin} is defined by tin =n x nl. What to do: 1 Let Sp = ty + tie +s +... + tin. Investigate S, for several different values of n. Hence conjecture an expression for $,. Prove your conjecture to be true using the principle of mathematical induction. rw Show that ty can be written as (n+ 1)!~n! and hence devise an alternative direct proof of your conjecture for $,. Let Cn = tin + ting. Write an expression for Cn in factorial notation, and simplify it. Let Ty =Ci+Co+Cst.u+Cn. Find T, for n=1,2,3,4, and 5, Conjecture an expression for Tp. Prove your conjecture for Ty by any method. INVESTIGATION 2 Already in the course we have seen equivalent statements which are connected by “if and only if”. enew For example, if the statements A and B are equivalent we write A B. In order to prove that two statements are equivalent, we need to prove that both: © if Ais true then B is also true, written A= B © if B is true then A is also true, written B= APROOF BY MATHEMATICAL INDUCTION (Chapter 10) 249 For example, consider the equivalent statements for n € Z*: (n+2)?—n? isa multiple of 8 q and 2m >pr ... (*) Now v2=V2x 28 = 2n = Pi maa Letting po = 2 — pi and a2 = pra, v2 = where po, q2€Z*, pa > 2 {since v2 > 1} and po

144n £ 3414.9 x 2+ is divisible by 25. % Prove that if uy =1 and tns1 tin +2", then ty =3"—2" forall n © Zt. 3° Use the principle of mathematical induction to prove that for all _n € Z*: a 71 is divisible by 6 bY (2-1) =n*@n? -1) & 1 Gain yaenth wanes ~ ri Oa @ 3-1 49M isdivisibleby7 — f Si +1)6-+2) = RATVEtD +d) | . q & 4 Prove that 3" — 1—2n is divisible by 4 for all non-negative integers n. 5 Use the principle of mathematical induction to prove that: sin? @ + sin? 20 + sin? 30 +....+sin?(nd) = $[n — Ll DA sin) ye at ne Zt. sind 6 Use the principle of mathematical induction to prove that 5?" +17% 7" is divi all non-negative integers n. le by 18 for 7 Consider the sequence defined by ug = 1, tt =3, and ting2 = 4tins1 —3uy forall n-€ Z, n>0. ‘@ Find the values of uo, us, and us. Hence conjecture a formula for up involving n only. Prove your conjecture is true using mathematical induction.252__ PROOF BY MATHEMATICAL INDUCTION (Chapter 10) 8 Use the principle of mathematical induction to prove that for all n € Zi: T] cos(2"-4z) = cosa x cos 2a x cos der x cos 82 X .... x cos(2"—lz) = ae Mf xan PSEA 1. Use the principle of mathematical induction to prove that for all n € Zit: a Sie mente & 3 © SFY =14On—1 xe A Hii +17 = NOVO 2Go+9) e@ star eet f 52+1413x 3" is divisible by 22. 2 Prove that 5” +3 is divisible by 4 for all integers n> 0. 3° Prove that if tu) =9 and tiny: =2uy +3(5"), then uy, =2"+1 45" for all ne Zt 4 Use the principle of mathematical induction to prove that a9" — 3” is divisible by 6 for all n €Z* ae 2 1x3 7 3x6 (n+) * + Gaan@ery 7 wary al new © Gn*+5n? +n is even for all integers n> 0 2-24 Pa 1H xn? 8"¥2 —7n — 15. is divi Bxt 4(-1y"'n(n+ 1) for alll integers n> 1 ble by 49 for all ne Z* 3 5 2n=1 4 , Fi 8 ort rem tet paca who ge forall integers: n> 2 Ae 1 1 1 ie s s I1(1+5)=G+0(1+5)(1+5)(2+5) (1+ 2) =n+1 forall ne zt. mle a 5 Use the principle of mathematical induction to prove that for all n © Zt, SPREE ange * Sinds * singe 1-7 Singaray cot.r—cot(2"x) whenever these terms are defined, 6 Prove that if wu =5 and tmy1=2tin —3(—1)", then tu =3(2")+(—1)" forall ne Zt. @ Show that cos(a ~ 3) — cos(a + 8) = 2sinasin G3. b Hence show that sinasin = (cos(a — 8) — cos(a + 8). € Hence show that sin|(k + 1)é}sin$ + sin #¢ sin E40? — gin BANE iy 20 d Use the principle of mathematical induction to prove that: sin [4(n, sin (40 aie forall ne Zt. 8 Use the principle of mathematical induction to prove the pigeonhole principle: sind +sin26 + sin 30 +... + sin(n6) “If n items are distributed amongst m pigeonholes with n,m €Z* and n> m, then at least ‘one pigeonhole will contain at least ~ items.”