ITM 107 Study Guide - Fall 2018, Comprehensive Term Test Notes - Graph Of A Function, Positive-Definite Matrix, Square Matrix

• School: Ryerson University
• Department: Information Technology Management
• Course: ITM 107
• Professor: A. Guergachi

Document Summary

If all the members of the set can be listed, the set is said to be a finite set. 2, 3, 4} and b = {x, y, z} are examples of finite sets: for an infinite set, we cannot list all the elements, so we use the three dots. For example, the set of all whole numbers n = {1, 2, 3, 4, . is an infinite set. It is possible for a set to contain no members. The empty set is a subset of every set. Also, a, b, a. In the discussion of particular sets, the assumption is always made that the sets under discussion are all subsets of some larger set, called the universal set u. The choice of the universal set depends on the problem under consideration: we may use venn diagrams to illustrate the relationships among sets.