Xguo9@student.gsu.edu Xuan Guo Lab 5 xguo9@student.gsu.edu Xuan Guo.

Slides:



Advertisements
Similar presentations
Completeness and Expressiveness
Advertisements

Introduction to Proofs
Equivalence Relations
Chapter 3 Direct Proof and Proof by Contrapositive
The Logic of Quantified Statements
More Set Definitions and Proofs 1.6, 1.7. Ordered n-tuple The ordered n-tuple (a1,a2,…an) is the ordered collection that has a1 as its first element,
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Discrete Structures & Algorithms Basics of Set Theory EECE 320 — UBC.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
2.1 Sets. DEFINITION 1 A set is an unordered collection of objects. DEFINITION 2 The objects in a set are called the elements, or members, of the set.
1.  We have studied groups, which is an algebraic structure equipped with one binary operation. Now we shall study rings which is an algebraic structure.
CMSC 250 Discrete Structures Exam #1 Review. 21 June 2007Exam #1 Review2 Symbols & Definitions for Compound Statements pq p  qp  qp  qp  qp  q 11.
Logic: Connectives AND OR NOT P Q (P ^ Q) T F P Q (P v Q) T F P ~P T F
So far we have learned about:
What is the best way to start? 1.Plug in n = 1. 2.Factor 6n 2 + 5n Let n be an integer. 4.Let n be an odd integer. 5.Let 6n 2 + 5n + 4 be an odd.
CSE115/ENGR160 Discrete Mathematics 02/14/12 Ming-Hsuan Yang UC Merced 1.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 12 Number theory Mathematical induction Proof by induction Examples.
1 Set Theory. 2 Set Properties Commutative Laws: Associative Laws: Distributive Laws:
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
1 Section 7.1 Relations and their properties. 2 Binary relation A binary relation is a set of ordered pairs that expresses a relationship between elements.
SETS A set B is a collection of objects such that for every object X in the universe the statement: “X is a member of B” Is a proposition.
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
Table of Contents Solving Equations In Quadratic Form There are several methods one can use to solve a quadratic equation. Sometimes we are called upon.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
MATH 224 – Discrete Mathematics
Homework Review notes Complete Worksheet #1. Homework Let A = {a,b,c,d}, B = {a,b,c,d,e}, C = {a,d}, D = {b, c} Describe any subset relationships. 1.
Chapter 5 Existence and Proof by contradiction
Copyright © 2014 Curt Hill Sets Introduction to Set Theory.
CompSci 102 Discrete Math for Computer Science
Boolean Algebras Lecture 27 Section 5.3 Wed, Mar 7, 2007.
5 – 2: Solving Quadratic Equations by Factoring Objective: CA 8: Students solve and graph quadratic equations by factoring, completing the square, or using.
Solving Quadratic Equations Quadratic Equations: Think of other examples?
Chapter 2 With Question/Answer Animations. Section 2.1.
Rosen 1.6, 1.7. Basic Definitions Set - Collection of objects, usually denoted by capital letter Member, element - Object in a set, usually denoted by.
Set identities.
Lecture # 12 Set Identities
Ch. 2 Basic Structures Section 1 Sets. Principles of Inclusion and Exclusion | A  B | = | A | + | B | – | A  B| | A  B  C | = | A | + | B | + | C.
UNIT - 2.  A binary operation on a set combines two elements of the set to produce another element of the set. a*b  G,  a, b  G e.g. +, -, ,  are.
Section 7.5 Trigonometric Equations Objective: To solve linear and quadratic trigonometric equations.
Functions (Mappings). Definitions A function (or mapping)  from a set A to a set B is a rule that assigns to each element a of A exactly one element.
CS104:Discrete Structures Chapter 2: Proof Techniques.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: Proofs and Set theory.
Week 4 - Friday.  What did we talk about last time?  Floor and ceiling  Proof by contradiction.
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
Set Operations Section 2.2.
1 Set Theory Second Part. 2 Disjoint Set let A and B be a set. the two sets are called disjoint if their intersection is an empty set. Intersection of.
Notions & Notations (2) - 1ICOM 4075 (Spring 2010) UPRM Department of Electrical and Computer Engineering University of Puerto Rico at Mayagüez Spring.
Introduction to Graph Theory & its Applications
EXAMPLE 3 Write an indirect proof Write an indirect proof that an odd number is not divisible by 4. GIVEN : x is an odd number. PROVE : x is not divisible.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
1 Lecture 5 Functions. 2 Functions in real applications Curve of a bridge can be described by a function Converting Celsius to Fahrenheit.
Introduction to Set Theory (§1.6) A set is a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different)
Chapter 1 Logic and proofs
Lecture 6 Set Theory.
Set Theory.
EQUATION IN TWO VARIABLES:
Sets Section 2.1.
Direct Proof by Contraposition Direct Proof by Contradiction
Chapter 1 Logic and Proofs Homework 2 Given the statement “A valid password is necessary for you to log on to the campus server.” Express the statement.
Set Operations Section 2.2.
Sets and Logic…. Chapter 3
Indirect Proof by Contradiction Direct Proof by Cases
CS 220: Discrete Structures and their Applications
Sets. EXAMPLE 1 The set O of odd positive integers less than 10 can be expressed by O = { l, 3, 5, 7, 9}. * This way of describing a set is known as.
A Brief Summary for Exam 1
Xuan Guo Lab 4 Xuan Guo
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
Algebraic Identities intro
CSC102 - Discrete Structures (Discrete Mathematics) Set Operations
Presentation transcript:

xguo9@student.gsu.edu Xuan Guo Lab 5 xguo9@student.gsu.edu Xuan Guo

Contents review some questions of hw2 review power set 24 section 1.4

Question 24 section 1.4 Translate in two ways each of these statements into logical expressions using predicates, quantifiers, and logical connectives. First, let the domain consist of the students in your class and second, let it consist of all people. c) There is a person in your class who cannot swim. d)All students in your class can solve quadratic equations.

Question 24 section 1.4 C(x):”student x is in your class”, S(x):”student x can swim” Q(x):”student x can solve quadratic equations” c) There is a person in your class who cannot swim. d)All students in your class can solve quadratic equations.

Solution C(x):”student x is in your class”, S(x):”student x can swim” Q(x):”student x can solve quadratic equations”

Question 18 section 1.7 Prove that if n is an integer and 3n+2 is even, then n is even using a) a proof by contraposition.

Question 18 section 1.7 Prove that if n is an integer and 3n+2 is even, then n is even using a) a proof by contraposition. Contraposition: if n is odd, then 3n+2 is odd.

Solutions Proof: Contraposition: if n is odd, then 3n+2 is odd. Assume n is odd, then n=2k+1 for some integer k. Then 3n+2=3*(2k+1)+2=6k+5=2*(3k+2)+1 is odd for some integer 3k+2. So if n is odd, then 3n+2 is odd. Then we can get the conclusion if n is an integer and 3n+2 is even, then n is even.

Question 19 section 2.1 19.What is the cardinality of each of these sets? a) {a} b){{a}} c) {a,{a}} d){a,{a},{a,{a}}}

Question 19 section 2.1 19.What is the cardinality of each of these sets? a) {a} 1 b){{a}} c) {a,{a}} 2 d){a,{a},{a,{a}}} 3

Question 23 section 2.1 How many elements does each of these sets have where a and b are distinct elements? a) P({a, b,{a, b}}) b)P({∅,a,{a},{{a}}}) c) P(P(∅))

Question 23 section 2.1 How many elements does each of these sets have where a and b are distinct elements? a) P({a, b,{a, b}}) b)P({∅,a,{a},{{a}}}) c) P(P(∅)) Given a set S, the power set of S is the set of all subsets of the set S. The power set of Sis denoted by P(S).

Question 23 section 2.1 How many elements does each of these sets have where a and b are distinct elements? a) P({a, b,{a, b}}) 8 b)P({∅,a,{a},{{a}}}) 16 c) P(P(∅)) 2

Question 3 section 2.2 3.LetA={1,2,3,4,5} and B={0,3,6}. Find a) A∪B. b)A∩B. c) A−B. d)B−A.

Question 3 section 2.2 3.LetA={1,2,3,4,5} and B={0,3,6}. Find a) A∪B. b)A∩B. b){3} c) A−B. c){1,2,4,5}d){0,6} d)B−A. d){0,6}

Question 13 section 2.2 Prove the second absorption law from Table 1 by showing that if A and B are sets, then A∩(A∪B)=A

Question 13 section 2.2 Prove the second absorption law from Table 1 by showing that if A and B are sets, then A∩(A∪B)=A Hint: A ⊆ A∩(A∪B) and A∩(A∪B) ⊆ A

Question 13 section 2.2 Prove the second absorption law from Table 1 by showing that if A and B are sets, then A∩(A∪B)=A Proof: Suppose x ∈A∩(A∪B). Then x ∈ A and x ∈ A∪B by the definition of intersection. Because x ∈ A, we have proved that the left-hand side is a subset of the right-hand side. Conversely, let x ∈A. Then by the definition of union, x ∈ A∪B as well. Therefore x ∈A∩(A∪B) by the definition of intersection, so the right-hand side is a subset of the left-hand side