# Math Primer. Andrzej Wąsowski February 12, 2007

Save this PDF as:

Size: px
Start display at page:

Download "Math Primer. Andrzej Wąsowski February 12, 2007"

## Transcription

1 Math Primer ndrzej Wąsowski February 12, 2007 Please, report all the bugs you can spot to the author! cknowledgments: Inspired by the appendix of Cormen et al. Introduction to lgorithms, and by some materials kindly provided by Volodya Shavrukov. Ingredients non exhaustive selection of mathematical concepts useful in an introductory algorithms course. Ingredients: basic set theory, relations, equivalence relations, functions, important functions, graphs, trees, combinatorics, basic sums, probability 1 asic Set Theory x S means x is a member of S x S means x is not a member of S Examples: 1. S = {1, 2, 3}, 2 S, 4 S 1

2 2. an empty set, for every a we have a 3. Z the set of all integers, Z = {..., 2, 1, 0, 1, 2,... } 4. R all real numbers, cannot be counted Sets are unordered: {1, 2, 3} = {3, 2, 1} = {1, 2, 3, 1} Definition 1. Set inclusion: if every a implies a Example: {1, 2} {1, 2, 3}. Definition 2. [-] The set of all subsets of set S is called the powerset of S, denoted 2 S or P(S). [-] Example: 2 {a,b} = {, {a}, {b}, {a, b}} Definition 3. cartesian product of two sets, denoted is the set of all ordered pairs, such that the first element of the pair is an element of and the second is an element of : = {(a, b) a and b } Example: {a, b} {a, b, c} = {(a, a), (a, b), (a, c), (b, a), (b, b), (b, c)} 1.1 Set Operations For any two sets, define [intersection] = {x x and x } [union] = {x x or x } [difference] \ = {x x and x } U [complement] = {x x U and x } = U \ where U is the universe (set of all elements discussed) and U. 2

3 1.2 Set Laws [-] Empty set: =, = [-] Idempotence: =, = [-] Commutativity: =, = ssociativity: ( C) = ( ) C Distributivity: ( C) = ( ) ( C) ( C) = ( ) ( C) Proof of the latter distributive law using Venn diagrams: = = C C C C C C C Venn diagrams only work up to three sets. Use definitions of operations to make proofs that cannot be made with Venn diagrams (or use definitions always). [-] bsorption: ( ) =, ( ) = [-] Complement Laws: =, =, = U De Morgan s Laws: = = Exercise. Prove de Morgan s laws using Venn diagrams. 1.3 Set Partition Definition 4. Two sets, are disjoint if they have no elements in common: = Definition 5. collection S = {S 1,..., S n } forms a partition of a set S iff 3

4 1. ll S i are nonempty. 2. ll S i are pairwise disjoint: i j = S i S j =. 3. Their union gives S: S = S 1... S n = S i = S i S n i=1 S i [-] Note: each element of S appears in exactly one S i : Partitioning into 8 classes: 1.4 Set Cardinality S number of elements in set S (cardinality of S) Properties: = 0 = + + For, disjoint: = + 2 S = 2 S = 4

5 2 Relations Definition 6. n n-ary relation R on sets 1,..., n is a subset of 1 2 n. If n = 2 then R is a binary relation. (a, b) R is typically written arb. Example: < relation on natural numbers. We write 1 < 2 instead of (1, 2) <. inary relations over R is reflexive iff for every a it holds that ara Example: on natural numbers, but not < on natural numbers. R is irreflexive iff for every a it holds that (a, a) R Example: < on natural numbers, but not on natural numbers. R is symmetric iff for every pair (a, b), arb implies bra. Example: = on natural naumbers, but not. R is transitive iff for every a, b, c it holds that arb and brc together imply arc. Example: =,, < on natural numbers [-] R is antisymmetric iff for every pair (a, b) if arb and bra then also a = b. Example: on natural numbers 5

6 3 Equivalence Relations Definition 7. reflexive, symmetric and transitive relation is called an equivalence relation. Example: = on natural numbers is an equivalence relation, but not < and (neither is symmetric and the former is not reflexive). Definition 8. Let R be an equivalence relation on. element a is a set [a] = { b b and arb }. The equivalence class of Example: R = {(a, b) a, b N and a + b is an even number. Proposition 9. R is an equivalence relation. Proof. R is reflexive (as a + a is even for any natural number a). R is symmetric (because a + b = b + a). R is transitive: ssume that arb and brc. If a is even then b and c are also even, so a + c is even. If a is odd then b is odd, and also c must be odd, so a + c is even. Equivalence classes of R: [4] = {0, 2, 4, 6,... } and [3] = {1, 3, 5, 7,... }. There are no more distinct classes of R. Theorem The equivalence classes of any equivalence relation R on form a partition of. 2. ny partition of determines an equivalence relation on, for which the sets in the partition are equivalence classes. Proof. First show that equivalence classes form a partition: 1. Each equivalence class is non-empty as for every a [a] due to reflexivity of R. 6

7 2. They cover the entire set: each [a] and for each a there exists a class containing a (indeed it is precisely [a]). So a [a] =. 3. Equivalence classes are disjoint: if two different classes overlap then because of transitivity, they actually are the same class. Contradiction, so it cannot be that two different classes overlap. The above three statements together mean that equivalence classes for a partition. Let us now turn to proving that a partition induces an equivalence class. Let = { 1,..., n } be a partition of. We shall define an equivalence relation, whose equivalence classes are the i sets. Take: R = { (a, b) there exists i such that a i and b i } It is easy to show that R is reflexive, symmetric and transitive (exercise). Equivalence classes of R are same as the i sets. First take any element a of any of the i sets. Observe that for any b i we have that b [a], which means that i [a]. t the same time for any b [a] we know that b i by definition of R, so [a] i. y antisymmetry of set inclusion we conclude that i = [a]. 7

8 4 Functions Definition 11. function f : is a binary relation on and such that for every a there exists precisely one such b that (a, b) f. We typically write f (a) = b meaning (a, b) f. The set is referred to as a domain of function f, while is sometimes called a codomain of the function. Figure 1: Function is a mapping. Example: f : N {0, 1}, where f = { (a, b) a, b N and b = a mod 2 } We would normally write: f (a) = a mod 2 Definition 12. function f : is a surjection if for every b there exists an a such that b = f (a). Figure 2: surjection (all elements on the right hand side are pointed at). Q. Which set has more elements on the above figure? or? Example: : N N, where (n) = n + 1 is not a surjection (no value in the domain maps to zero in codomain). 8

9 Definition 13. function f : is an injection if for distinct arguments it produces different values: a a implies f (a) f (a ). Figure 3: n injection (elements on the right hand side are pointed at by at most one arrow). Q. Which set has more elements on the above figure? or? Example: from earlier examples is an injection, while f is not. Definition 14. function f : is a bijection if it is both an injection and a surjection. Injection defines a one-to-one correspondence between elements of domain and codomain. Figure 4: bijection (all codomain elements are paired with domain elements). Q. Which set has more elements on the above figure? or? Example: Neither f nor are bijections. Function h : Z Z, where h(x) = x is a bijection. Exercise. Is the function f (x) = x + 1 bijective when the domain and the codomain are N? 9

10 5 Common Functions Floor x for a real number x is the greatest integer less than or equal to x. Ceiling x for a real number x is the least integer greater than or equal to x. Exponentials a 0 = 1, (1) a 1 = 1 a, (2) (a m ) n = a mn, (3) a m a n = a m+n, (4) Logarithms logarithm of a with base b (b 1), written log b a, is a number c such that b c = a. ssume that a, b, c > 0. log c (ab) = log c a + log c b, (5) log b a n = n log b a, (6) log b a = log c a log c b (7) We typically mean a logarithm with base 2, when we drop the base writing log a (sometimes also lg a). Some authors mean a logarithm with base 10, when writing log a. Note that in algorithmic this causes no confusion, in most of the cases as log 2 a is only by a constant factor different from log 10 a. Similarly the natural logarithm of a, written ln a (which is log e a), differs only by a constant factor from other logarithms, too. 10

11 6 Graphs 6.1 Directed Graphs 6.2 Undirected Graphs a loop directed graph (a digraph) Definition 15. directed graph G is a pair G = (V, E), where V is a set of vertices, and E is a binary relation on V (edges) n undirected graph Definition 16. n undirected graph G is a pair G = (V, E), where V is a set of vertices, and E is a symmetric and irreflexive binary relation on V (edges) formal interpretation of pictures: v 1 v 2 means (v 1, v 2 ) E v 1 v 2 means (v 1, v 2 ) E v 1 v 2 {(v 1, v 2 ), (v 2, v 1 )} E v 1 v 2 {(v 1, v 2 ), (v 2, v 1 )} E = Our text book (RS) often uses E and V to denote number of edges and vertices: E = E and V = V E = 1 / 2 E and V = V Note: Graph is not a picture! These pictures show the same undirected graph

12 v 1 v 2 v 1 v 2 (v 1, v 2 ) is incident from v 1 (leaves v 1 ) {v 1, v 2 } is incident on both v 1 and v 2 (v 1, v 2 ) is incident to v 2 (enters v 2 ) out-deg v out-degree, the number of edges leaving v in-deg v in-degree, the number of edges entering v deg v degree, the number of edges incident on v property: 2E = E = deg v (8) v V Q. Why? 6.3 Directed Paths 6.4 Undirected Paths v 2 v 2 v 1 v 1 path from v 1 to v 2 path between v 1 and v 2 graph G is connected if there is a path between any two of its vertices. path (both directed and undirected) is called a simple path if each of its vertices occurs in it at most once (so cannot happen). 12

13 6.5 Directed Cycles 6.6 Undirected Cycles cycle is a path with both the beginning and the end in the same vertex. directed cycle directed graph not containing any cycles is called a directed acyclic graph n undirected cycle n undirected graph not containing any cycles is called a forest If a forest is connected then we call it a tree 7 Trees Trees look like this: Figure 5: tree Trees are often rooted depth root x v u ancestors of u: {v, root} u is a descendant of root v is a parent of u u is a child of v x is a sibling of u u is a leaf (so is x) v is an internal node Figure 6: rooted tree (the same as before, but with a designated root node) 13

14 Definition 17. rooted tree such that each of its nodes has at most two children is called a binary tree. binary tree is a complete binary tree of depth n if all its leaves have depth n and all its internal nodes have exactly two children. We often denote a complete binary tree of depth n as T n. Observe how wide the tree becomes with the growth of n. Figure 7: T 3 on the left, a shape of T n for large n on the right. Q. How many leaves does T n have? Figure 8: ny leaf is uniquely determined by a sequence of n bits. So there is a bijection between the set of leaves of T n and the set of all binary strings of length n (or in other words there is equally many of each). There are = 2 n different binary sequences of length n. 14

15 8 Combinatorics & asic Sums Let X = {a 1,..., a n } Q. How many subsets does X have? Each subset is uniquely identified by a sequence of n bits, saying which elements are in and which are not. bijection again: 2 n. Q. How many nodes in T n? (previously we have asked about leaves only) 2 n + 2 n = 2n = 2n+1 1 (9) (computed using a formula for a sum of a geometric series) Geometric series sequence of numbers of the form x 0, x 1, x 2, x 3,... is called a geometric series. The sum of the first n elements can be computed using the following formula (for x 1): x n + x n x 1 + x 0 = xn+1 1 x 1 (10) Why? Take the sum and multiply it by (x 1). fter simplifying a simple closed form is obtained, equal to the sum multiplied by (x 1). (x n + x n x 1 + x 0 )(x 1) = = x n+1 + x n + + x 2 + x 1 (x n + x n x 1 + x 0 ) = = x n+1 1 (11) Divide by (x 1) and you are done. 15

16 Incidentally if x < 1 the value of the infinite sum is finite. In such case: k=0 x k = 1 1 x (12) Permutations Let X = {a 1,..., a n } permutation of X is an ordered sequence of all elements of X. Example. Let X = {a, b, c} Permutations of X are abc, bac, cab, acb, bca, cba (6 altogether). Definition 18. Let k n. k-permutation of S = {a 1,..., a n } is an ordered sequence of k distinct elements of S. Example. Let X = {a, b, c, d}. 2-permuations of X are ab, ba, ca, da ac, bc, cb, db ad, bd, cd, dc (12 altogether) We denote the number of k-permutations of an n-element set by P n. k P n k = n(n 1)(n 2) (n (k 1)) = n(n 1) 1 (n k)(n k 1) 1 = n! (n k)! (13) S n := P n n = n! (14) Combinations. k-combination of an n-element set X is a k-element subset of X. C n denotes the number of different k-combinations of an n-element set. k Example. X = {a, b, c, d}, 2-combinations of X are: {a, b}, {b, c}, {a, c}, {b, d}, {a, d}, {c, d} (6 altogether). 16

17 Q. How many? Since P n k = Cn k S k (15) so C n k = Pn k S k = n! (n k)!k! (16) rithmethic Series The following sum is known as an arithmetic series: The sum of the first n elements can be computed using the following formula: n k = k=1 n(n + 1) 2 (17) It can be verified easily using mathematical induction. 17

18 9 Probability n elementary event is a possible single outcome of an experiment. ll elementary events are different and mutually exclusive (it cannot be that a single experiments results in two elementary events). set of all elementary events S for a given experiment is called a sample space. n event (note: not elementary) is a subset of the sample space, so S. function P : 2 S [0; 1] is a probability distribution iff 1. P() 0 for any event S. 2. P(S) = 1 3. P( ) = P() + P() for any mutually exclusive events S, S. For an event the value of P( is called the probability of. Probability of an impossible event is zero. For two independent experiments S 1, S 2 the probability of an event that the first one results in an event 1 S 1 and the second results in 2 S 2 equals P( 1 ) P( 2 ). random variable X is a function from the sample space to the real numbers R, assigning a real number with each possible outcome of an experiment. For a random variable X and a number x we define X = x to be an event {s S X(s) = x}. The probability of such an event is: P{X = x} = P(s). (18) {s S X(s)=x} The expected value EX of a random variable X is defined by EX = x P{X = x}. (19) x 18

### Sets, Relations and Functions

Sets, Relations and Functions Eric Pacuit Department of Philosophy University of Maryland, College Park pacuit.org epacuit@umd.edu ugust 26, 2014 These notes provide a very brief background in discrete

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### The Language of Mathematics

CHPTER 2 The Language of Mathematics 2.1. Set Theory 2.1.1. Sets. set is a collection of objects, called elements of the set. set can be represented by listing its elements between braces: = {1, 2, 3,

### Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

### Lecture 17 : Equivalence and Order Relations DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

### A set is a Many that allows itself to be thought of as a One. (Georg Cantor)

Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domains

### Relations Graphical View

Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Introduction Recall that a relation between elements of two sets is a subset of their Cartesian product (of ordered pairs). A binary

### Classical Analysis I

Classical Analysis I 1 Sets, relations, functions A set is considered to be a collection of objects. The objects of a set A are called elements of A. If x is an element of a set A, we write x A, and if

### Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

### INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

### Sets and set operations: cont. Functions.

CS 441 Discrete Mathematics for CS Lecture 8 Sets and set operations: cont. Functions. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Set Definition: set is a (unordered) collection of objects.

### Sets. A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object.

Sets 1 Sets Informally: A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object. Examples: real numbers, complex numbers, C integers, All students in

### Sets and functions. {x R : x > 0}.

Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.

### Equivalence Relations

Equivalence Relations Definition An equivalence relation on a set S, is a relation on S which is reflexive, symmetric and transitive. Examples: Let S = Z and define R = {(x,y) x and y have the same parity}

### Discrete Mathematics, Chapter 5: Induction and Recursion

Discrete Mathematics, Chapter 5: Induction and Recursion Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 5 1 / 20 Outline 1 Well-founded

### Sets and set operations

CS 441 Discrete Mathematics for CS Lecture 7 Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square asic discrete structures Discrete math = study of the discrete structures used

### Graph Theory. Introduction. Distance in Graphs. Trees. Isabela Drămnesc UVT. Computer Science Department, West University of Timişoara, Romania

Graph Theory Introduction. Distance in Graphs. Trees Isabela Drămnesc UVT Computer Science Department, West University of Timişoara, Romania November 2016 Isabela Drămnesc UVT Graph Theory and Combinatorics

### SETS, RELATIONS, AND FUNCTIONS

September 27, 2009 and notations Common Universal Subset and Power Set Cardinality Operations A set is a collection or group of objects or elements or members (Cantor 1895). the collection of the four

### vertex, 369 disjoint pairwise, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 466 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

### This chapter describes set theory, a mathematical theory that underlies all of modern mathematics.

Appendix A Set Theory This chapter describes set theory, a mathematical theory that underlies all of modern mathematics. A.1 Basic Definitions Definition A.1.1. A set is an unordered collection of elements.

### The concept of probability is fundamental in statistical analysis. Theory of probability underpins most of the methods used in statistics.

Elementary probability theory The concept of probability is fundamental in statistical analysis. Theory of probability underpins most of the methods used in statistics. 1.1 Experiments, outcomes and sample

### Cartesian Products and Relations

Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special

### Solutions to Exercises 8

Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 8 (1) Suppose that G is a graph in which every vertex has degree at least k, where k 1, and in which every cycle contains at least 4 vertices.

### Mathematics for Algorithm and System Analysis

Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface

### Some Definitions about Sets

Some Definitions about Sets Definition: Two sets are equal if they contain the same elements. I.e., sets A and B are equal if x[x A x B]. Notation: A = B. Recall: Sets are unordered and we do not distinguish

### Discrete Mathematics. Hans Cuypers. October 11, 2007

Hans Cuypers October 11, 2007 1 Contents 1. Relations 4 1.1. Binary relations................................ 4 1.2. Equivalence relations............................. 6 1.3. Relations and Directed Graphs.......................

### CHAPTER 1. Basic Ideas

CHPTER 1 asic Ideas In the end, all mathematics can be boiled down to logic and set theory. ecause of this, any careful presentation of fundamental mathematical ideas is inevitably couched in the language

### Problem Set 1 Solutions Math 109

Problem Set 1 Solutions Math 109 Exercise 1.6 Show that a regular tetrahedron has a total of twenty-four symmetries if reflections and products of reflections are allowed. Identify a symmetry which is

### Review for Final Exam

Review for Final Exam Note: Warning, this is probably not exhaustive and probably does contain typos (which I d like to hear about), but represents a review of most of the material covered in Chapters

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### Logic & Discrete Math in Software Engineering (CAS 701) Dr. Borzoo Bonakdarpour

Logic & Discrete Math in Software Engineering (CAS 701) Background Dr. Borzoo Bonakdarpour Department of Computing and Software McMaster University Dr. Borzoo Bonakdarpour Logic & Discrete Math in SE (CAS

### CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

### Solutions to In-Class Problems Week 4, Mon.

Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science September 26 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised September 26, 2005, 1050 minutes Solutions

### Basic Set Theory. Chapter Set Theory. can be written: A set is a Many that allows itself to be thought of as a One.

Chapter Basic Set Theory A set is a Many that allows itself to be thought of as a One. - Georg Cantor This chapter introduces set theory, mathematical induction, and formalizes the notion of mathematical

### Week 5: Binary Relations

1 Binary Relations Week 5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all

### Mathematical induction. Niloufar Shafiei

Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of

### Principle of (Weak) Mathematical Induction. P(1) ( n 1)(P(n) P(n + 1)) ( n 1)(P(n))

Outline We will cover (over the next few weeks) Mathematical Induction (or Weak Induction) Strong (Mathematical) Induction Constructive Induction Structural Induction Principle of (Weak) Mathematical Induction

### MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

### In mathematics you don t understand things. You just get used to them. (Attributed to John von Neumann)

Chapter 1 Sets and Functions We understand a set to be any collection M of certain distinct objects of our thought or intuition (called the elements of M) into a whole. (Georg Cantor, 1895) In mathematics

### Graph Theory Notes. Vadim Lozin. Institute of Mathematics University of Warwick

Graph Theory Notes Vadim Lozin Institute of Mathematics University of Warwick 1 Introduction A graph G = (V, E) consists of two sets V and E. The elements of V are called the vertices and the elements

### Announcements. CompSci 230 Discrete Math for Computer Science Sets. Introduction to Sets. Sets

CompSci 230 Discrete Math for Computer Science Sets September 12, 2013 Prof. Rodger Slides modified from Rosen 1 nnouncements Read for next time Chap. 2.3-2.6 Homework 2 due Tuesday Recitation 3 on Friday

### Climbing an Infinite Ladder

Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder and the following capabilities: 1. We can reach the first rung of the ladder. 2. If we can reach a particular rung of the ladder,

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

### S(A) X α for all α Λ. Consequently, S(A) X, by the definition of intersection. Therefore, X is inductive.

MA 274: Exam 2 Study Guide (1) Know the precise definitions of the terms requested for your journal. (2) Review proofs by induction. (3) Be able to prove that something is or isn t an equivalence relation.

### More Mathematical Induction. October 27, 2016

More Mathematical Induction October 7, 016 In these slides... Review of ordinary induction. Remark about exponential and polynomial growth. Example a second proof that P(A) = A. Strong induction. Least

### 1.1 Logical Form and Logical Equivalence 1

Contents Chapter I The Logic of Compound Statements 1.1 Logical Form and Logical Equivalence 1 Identifying logical form; Statements; Logical connectives: not, and, and or; Translation to and from symbolic

### Sample Problems in Discrete Mathematics

Sample Problems in Discrete Mathematics This handout lists some sample problems that you should be able to solve as a pre-requisite to Computer Algorithms Try to solve all of them You should also read

### Long questions answer Advanced Mathematics for Computer Application If P= , find BT. 19. If B = 1 0, find 2B and -3B.

Unit-1: Matrix Algebra Short questions answer 1. What is Matrix? 2. Define the following terms : a) Elements matrix b) Row matrix c) Column matrix d) Diagonal matrix e) Scalar matrix f) Unit matrix OR

### In mathematics there are endless ways that two entities can be related

CHAPTER 11 Relations In mathematics there are endless ways that two entities can be related to each other. Consider the following mathematical statements. 5 < 10 5 5 6 = 30 5 5 80 7 > 4 x y 8 3 a b ( mod

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### What is a set? Sets. Specifying a Set. Notes. The Universal Set. Specifying a Set 10/29/13

What is a set? Sets CS 231 Dianna Xu set is a group of objects People: {lice, ob, Clara} Colors of a rainbow: {red, orange, yellow, green, blue, purple} States in the S: {labama, laska, Virginia, } ll

### INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

### Mathematical induction & Recursion

CS 441 Discrete Mathematics for CS Lecture 15 Mathematical induction & Recursion Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Proofs Basic proof methods: Direct, Indirect, Contradiction, By Cases,

### Math 3000 Running Glossary

Math 3000 Running Glossary Last Updated on: July 15, 2014 The definition of items marked with a must be known precisely. Chapter 1: 1. A set: A collection of objects called elements. 2. The empty set (

### ORDERS OF ELEMENTS IN A GROUP

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

### Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

### (a) (b) (c) Figure 1 : Graphs, multigraphs and digraphs. If the vertices of the leftmost figure are labelled {1, 2, 3, 4} in clockwise order from

4 Graph Theory Throughout these notes, a graph G is a pair (V, E) where V is a set and E is a set of unordered pairs of elements of V. The elements of V are called vertices and the elements of E are called

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

### Mathematics Review for MS Finance Students

Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,

### Math 117 Chapter 7 Sets and Probability

Math 117 Chapter 7 and Probability Flathead Valley Community College Page 1 of 15 1. A set is a well-defined collection of specific objects. Each item in the set is called an element or a member. Curly

### Automata and Formal Languages

Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,

### CHAPTER 5: MODULAR ARITHMETIC

CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called

### Sections 2.1, 2.2 and 2.4

SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete

### 1 Introduction. 2 Basic Principles. 2.1 Multiplication Rule. [Ch 9] Counting Methods. 400 lecture note #9

400 lecture note #9 [Ch 9] Counting Methods 1 Introduction In many discrete problems, we are confronted with the problem of counting. Here we develop tools which help us counting. Examples: o [9.1.2 (p.

### 7 Relations and Partial Orders

mcs-ftl 2010/9/8 0:40 page 213 #219 7 Relations and Partial Orders A relation is a mathematical tool for describing associations between elements of sets. Relations are widely used in computer science,

### Discrete Mathematics Lecture 5. Harper Langston New York University

Discrete Mathematics Lecture 5 Harper Langston New York University Empty Set S = {x R, x 2 = -1} X = {1, 3}, Y = {2, 4}, C = X Y (X and Y are disjoint) Empty set has no elements Empty set is a subset of

### CmSc 175 Discrete Mathematics Lesson 10: SETS A B, A B

CmSc 175 Discrete Mathematics Lesson 10: SETS Sets: finite, infinite, : empty set, U : universal set Describing a set: Enumeration = {a, b, c} Predicates = {x P(x)} Recursive definition, e.g. sequences

### You know from calculus that functions play a fundamental role in mathematics.

CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.

### Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting

Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Colin Stirling Informatics Slides originally by Kousha Etessami Colin Stirling (Informatics) Discrete Mathematics (Chapter 6) Today 1 /

### Axiom A.1. Lines, planes and space are sets of points. Space contains all points.

73 Appendix A.1 Basic Notions We take the terms point, line, plane, and space as undefined. We also use the concept of a set and a subset, belongs to or is an element of a set. In a formal axiomatic approach

### Introduction Russell s Paradox Basic Set Theory Operations on Sets. 6. Sets. Terence Sim

6. Sets Terence Sim 6.1. Introduction A set is a Many that allows itself to be thought of as a One. Georg Cantor Reading Section 6.1 6.3 of Epp. Section 3.1 3.4 of Campbell. Familiar concepts Sets can

### . 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 11

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According

### Discrete Mathematics Problems

Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................

### Full and Complete Binary Trees

Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full

### Chapter 10. Abstract algebra

Chapter 10. Abstract algebra C.O.S. Sorzano Biomedical Engineering December 17, 2013 10. Abstract algebra December 17, 2013 1 / 62 Outline 10 Abstract algebra Sets Relations and functions Partitions and

### Notes on counting finite sets

Notes on counting finite sets Murray Eisenberg February 26, 2009 Contents 0 Introduction 2 1 What is a finite set? 2 2 Counting unions and cartesian products 4 2.1 Sum rules......................................

### Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS

Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS 1.1.25 Prove that the Petersen graph has no cycle of length 7. Solution: There are 10 vertices in the Petersen graph G. Assume there is a cycle C

### Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

### 2.1.1 Examples of Sets and their Elements

Chapter 2 Set Theory 2.1 Sets The most basic object in Mathematics is called a set. As rudimentary as it is, the exact, formal definition of a set is highly complex. For our purposes, we will simply define

### Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

### Theory of Computation

Theory of Computation For Computer Science & Information Technology By www.thegateacademy.com Syllabus Syllabus for Theory of Computation Regular Expressions and Finite Automata, Context-Free Grammar s

### TREES IN SET THEORY SPENCER UNGER

TREES IN SET THEORY SPENCER UNGER 1. Introduction Although I was unaware of it while writing the first two talks, my talks in the graduate student seminar have formed a coherent series. This talk can be

### The set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;

Chapter 5 Set Theory 5.1 Sets and Operations on Sets Preview Activity 1 (Set Operations) Before beginning this section, it would be a good idea to review sets and set notation, including the roster method

### 1 The Concept of a Mapping

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 1 The Concept of a Mapping The concept of a mapping (aka function) is important throughout mathematics. We have been dealing

### A. V. Gerbessiotis CS Spring 2014 PS 3 Mar 24, 2014 No points

A. V. Gerbessiotis CS 610-102 Spring 2014 PS 3 Mar 24, 2014 No points Problem 1. Suppose that we insert n keys into a hash table of size m using open addressing and uniform hashing. Let p(n, m) be the

### Module 6: Basic Counting

Module 6: Basic Counting Theme 1: Basic Counting Principle We start with two basic counting principles, namely, the sum rule and the multiplication rule. The Sum Rule: If there are n 1 different objects

### The Basics of Counting. Niloufar Shafiei

The Basics of Counting Niloufar Shafiei Counting applications Counting has many applications in computer science and mathematics. For example, Counting the number of operations used by an algorithm to

### Graph Homomorphisms and Universal Algebra Course Notes

Graph Homomorphisms and Universal Algebra Course Notes Manuel Bodirsky, Institut für Algebra, TU Dresden, Manuel.Bodirsky@tu-dresden.de October 7, 2016 Contents 1 The Basics 2 1.1 Graphs and Digraphs................................

### DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

Professor Kindred Math 04 Graph Theory Homework 7 Solutions April 3, 03 Introduction to Graph Theory, West Section 5. 0, variation of 5, 39 Section 5. 9 Section 5.3 3, 8, 3 Section 7. Problems you should

### MATHEMATICS (CLASSES XI XII)

MATHEMATICS (CLASSES XI XII) General Guidelines (i) All concepts/identities must be illustrated by situational examples. (ii) The language of word problems must be clear, simple and unambiguous. (iii)

### 1. Determine all real numbers a, b, c, d that satisfy the following system of equations.

altic Way 1999 Reykjavík, November 6, 1999 Problems 1. etermine all real numbers a, b, c, d that satisfy the following system of equations. abc + ab + bc + ca + a + b + c = 1 bcd + bc + cd + db + b + c

### Sets and Logic. Chapter Sets

Chapter 2 Sets and Logic This chapter introduces sets. In it we study the structure on subsets of a set, operations on subsets, the relations of inclusion and equality on sets, and the close connection

### Automata and Languages

Automata and Languages Computational Models: An idealized mathematical model of a computer. A computational model may be accurate in some ways but not in others. We shall be defining increasingly powerful

### MATH 131 SOLUTION SET, WEEK 12

MATH 131 SOLUTION SET, WEEK 12 ARPON RAKSIT AND ALEKSANDAR MAKELOV 1. Normalisers We first claim H N G (H). Let h H. Since H is a subgroup, for all k H we have hkh 1 H and h 1 kh H. Since h(h 1 kh)h 1

### Notes on Matrix Multiplication and the Transitive Closure

ICS 6D Due: Wednesday, February 25, 2015 Instructor: Sandy Irani Notes on Matrix Multiplication and the Transitive Closure An n m matrix over a set S is an array of elements from S with n rows and m columns.