EECS 1019 Study Guide - Midterm Guide: Mathematical Induction

• School: York University
• Department: Electrical Engineering and Computer Science
• Course: EECS 1019
• Professor: All

Document Summary

Questions 1-11 are worth 1 point each: suppose f n n has the rule f(n) = 4n + 1. Ans: yes: suppose f n n has the rule f(n) = 4n + 1. Ans: no: suppose f z z has the rule f(n) = 3n2 1. Ans: no: suppose f z z has the rule f(n) = 3n 1. In the questions below suppose g a b and f b c where a = b = c = 1 2 3 4 , g = (1 4) (2 1) (3 1) (4 2) and f = (1 3) (2 2) (3 4) (4 2) : find f g. Ans: 25: suppose s = {1, 2, 3, 4, 5}. In the three questions below give a recursive definition with initial condition(s): the function f (n) = 2n, n = 1, 2, 3,