Solved In 1 6 Prove The Following Statements By Chegg Com
Explanation using the method of proof by induction this involves the following steps ∙ prove true for some value, say n = 1 ∙ assume the result is true for n = k ∙ prove true for n = k 1 n = 1 → LH S = 12 = 1 and RHS = 1 6 (1 1)(2 1) = 1 ⇒result is true for n = 1N2 2 The result is always n And since you are adding two numbers together, there are only (n1)/2 pairs that can be made from (n1) numbers So it is like (N1)/2 * N
