Multiplication principle Factorials Permutation (n)k, Combination ("). n n Binomial Theorem: (rty)" = > (")ky"- and application problems using derivatives such as _ k(") K=0 k=1 Definition of Injective, Surjective, Bijective. 3. TOPIC III Theorem 3.1 (Principle of Induction). Let S(n) be a family of statements. Assume that 1. S(1) is true. 2. S(k) is true = S(k + 1) is true. Then S(n) is true for all n E N. Theorem 3.2 (Principle of Strong Induction). Let S(n) be a family of statements. Assume that 1. S(1) is true. 2. S(i) is true for all 1