MATH 13 Study Guide - Final Guide: Rational Number, Surjective Function, Modular Arithmetic
Document Summary
For each statement below, circle t or f according to whether the statement is true or false. You do not need to justify your answers. g f : a c is a bijection, then f and g must be bijections. T f(cid:13) if f : a b and g : b c are functions and the composition. T(cid:13) f p = q is logically equivalent to (p ( q)). T f(cid:13) if r is a transitive relation on the set a, then (a a) r must. T(cid:13) f for all sets a and b, if there is an injection from a to b and b is also be a transitive relation on a. countable, then a is countable. T(cid:13) f for every integer a, either a2 0 (mod 3) or a2 1 (mod 3). T f(cid:13) there is a bijection from q to r. T f(cid:13) for all sets a and b, there is a bijection from ab to ba.
