MAT102H5 Study Guide - Quiz Guide: Euclidean Algorithm, Surjective Function, Bijection

• School: UTM
• Department: Mathematics
• Course: MAT102H5
• Professor: none

Document Summary

Practice problems: (also work on past exams, posted on the course website. : use a truth table to verify the logical equivalence of. [ (p ( q))] and [( p ) q: without using the symbol , write the negation of the following statement: ( m n)( n n)(m = n2) Justify your answer: let {an} be the sequence given by a1 = 3 and an+1 = 2an + 5 . Use induction to prove that an > 2n for all n n : write a negation of the following statement without using words of negation: Explain: prove by contradiction: if the sum of n natural numbers is less than n + 2 then each of these numbers is less than 3, let a, b and c three sets. Prove that this is an equivalence relation, and nd the equivalence class of the number 1.