Discrete Mathematics CS 2610 February 10, 2009. 2 Agenda Previously Functions And now Finish functions Start Boolean algebras (Sec. 11.1)

Slides:



Advertisements
Similar presentations
PROOF BY CONTRADICTION
Advertisements

Functions Section 2.3 of Rosen Fall 2008
1 Section 10.1 Boolean Functions. 2 Computers & Boolean Algebra Circuits in computers have inputs whose values are either 0 or 1 Mathematician George.
1 Section 1.8 Functions. 2 Loose Definition Mapping of each element of one set onto some element of another set –each element of 1st set must map to something,
TR1413: Discrete Mathematics For Computer Science Lecture 1: Mathematical System.
Fall 2002CMSC Discrete Structures1 Yes, No, Maybe... Boolean Algebra.
Section Section Summary Introduction to Boolean Algebra Boolean Expressions and Boolean Functions Identities of Boolean Algebra Duality The Abstract.
Functions.
Section 1.8: Functions A function is a mapping from one set to another that satisfies certain properties. We will first introduce the notion of a mapping.
Chapter 10.1 and 10.2: Boolean Algebra Based on Slides from Discrete Mathematical Structures: Theory and Applications.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Sets Set Operations Functions. 1. Sets 1.1 Introduction and Notation 1.2 Cardinality 1.3 Power Set 1.4 Cartesian Products.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sifth Edition, Mc Graw-Hill, 2007 Chapter 2: Basic Structures: Sets, Functions, Sequences.
2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations.
FUNCTION Discrete Mathematics Asst. Prof. Dr. Choopan Rattanapoka.
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
Applied Discrete Mathematics Week 13: Boolean Algebra
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Introduction to Proofs
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
February 12, 2015Applied Discrete Mathematics Week 2: Functions and Sequences 1Exercises Question 1: Given a set A = {x, y, z} and a set B = {1, 2, 3,
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
ICS 253: Discrete Structures I
Discrete Mathematics Math Review. Math Review: Exponents, logarithms, polynomials, limits, floors and ceilings* * This background review is useful for.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 – 7.2 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean.
Chapter 2 Mathematical preliminaries 2.1 Set, Relation and Functions 2.2 Proof Methods 2.3 Logarithms 2.4 Floor and Ceiling Functions 2.5 Factorial and.
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Copyright  The McGraw-Hill Companies, Inc. Permission required for reproduction.
Fall 2002CMSC Discrete Structures1 … and the following mathematical appetizer is about… Functions.
10/26/20151 … and the following mathematical appetizer is about… Functions.
1 Annoucement n Skills you need: (1) (In Thinking) You think and move by Logic Definitions Mathematical properties (Basic algebra etc.) (2) (In Exploration)
Discrete Mathematics CS 2610 September 12, Agenda Last class Functions  Vertical line rule  Ordered pairs  Graphical representation  Predicates.
Functions Section 2.3 of Rosen Spring 2012 CSCE 235 Introduction to Discrete Structures Course web-page: cse.unl.edu/~cse235 Questions: Use Piazza.
Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.
Example Prove that: “IF 3n + 2 is odd, then n is odd” Proof by Contradiction: -p = 3n + 2 is odd, q = n is odd. -Assume that ~(p  q) is true OR -(p 
Basic Structures: Functions Muhammad Arief download dari
Chapter 6. Threshold Logic. Logic design of sw functions constructed of electronic gates different type of switching element : threshold element. Threshold.
Discrete Mathematics CS 2610 February 12, Agenda Previously Finished functions Began Boolean algebras And now Continue with Boolean algebras.
Fall 2003CMSC Discrete Structures1 … and now for something completely different… Set Theory Actually, you will see that logic and set theory are.
Discrete Mathematics CS 2610 September Equal Boolean Functions Two Boolean functions F and G of degree n are equal iff for all (x 1,..x n )  B.
Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems and pg. 171.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
Mathematical Preliminaries
Review 2 Basic Definitions Set - Collection of objects, usually denoted by capital letter Member, element - Object in a set, usually denoted by lower.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 9 Boolean Algebras and Combinatorial Circuits.
CSC102 - Discrete Structures Functions
1 Functions CS 202 Epp section ??? Aaron Bloomfield.
CS104:Discrete Structures Chapter 2: Proof Techniques.
FUNCTIONS COSC-1321 Discrete Structures 1. Function. Definition Let X and Y be sets. A function f from X to Y is a relation from X to Y with the property.
Introduction to Proofs
Section 1.7. Definitions A theorem is a statement that can be shown to be true using: definitions other theorems axioms (statements which are given as.
Boolean Algebra.
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.
Section 2.3. Section Summary  Definition of a Function. o Domain, Cdomain o Image, Preimage  One-to-one (Injection), onto (Surjection), Bijection 
FUNCTIONS.
Mu.com.lec 9. Overview Gates, latches, memories and other logic components are used to design computer systems and their subsystems Good understanding.
Discrete Mathematics Functions
Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)
… and now for the Final Topic:
September 7 Notes Boolean Algebra.
CMSC Discrete Structures
Yes, No, Maybe... BooleanAlgebra 12/10/2018.
Chapter 10.1 and 10.2: Boolean Algebra
Chapter 10.1 and 10.2: Boolean Algebra
Chapter 10.1 and 10.2: Boolean Algebra
Applied Discrete Mathematics Week 4: Functions
A Brief Summary for Exam 1
Chapter 10.1 and 10.2: Boolean Algebra
CMSC Discrete Structures
Boolean Algebra.
Presentation transcript:

Discrete Mathematics CS 2610 February 10, 2009

2 Agenda Previously Functions And now Finish functions Start Boolean algebras (Sec. 11.1)

3 But First p  q  r, is NOT true when only one of p, q, or r is true. Why not? It is true for (p Λ ¬q Λ ¬r) It is true for (¬p Λ q Λ ¬r) It is true for (¬p Λ ¬q Λ r) So what’s wrong? Raise your hand when you know.

4 Injective Functions (one-to-one) If function f : A  B is 1-to-1 then every b  B has 0 or 1 pre-image. Proof (bwoc): Say f is 1-to-1 and b  B has 2 or more pre-images. Then  a 1, a 2 st a 1  A and a 2  A, and a 1 ≠ a 2. So f(a 1 ) = b and f(a 2 ) = b, meaning f(a 1 ) = f(a 2 ). This contradicts the definition of an injection since when a 1 ≠ a 2 we know f(a 1 ) ≠ f(a 2 ).

5 Combining Real Functions Given f :R  R and g :R  R then (f  g): R  R, is defined as (f  g)(x) = f(x)  g(x) (f · g): R  R is defined as (f · g)(x) = f(x) · g(x) Example: Let f :R  R be f(x) = 2x and and g :R  R beg(x) = x 3 (f+g)(x) = x 3 +2x (f · g)(x) = 2x 4

6 Monotonic Real Functions Let f: A  B such that A,B  R f is strictly increasing iff  for all x, y  A x > y  f(x) > f(y) f is strictly decreasing iff  for all x, y  A, x > y  f(x) < f(y) Example: f: R+  R+, f(x) = x 2 is strictly increasing

7 Increasing Functions are Injective Theorem: A strictly increasing function is always injective Proof:

8 Floor and Ceiling Function Definition: The floor function .  :R → Z,  x  is the largest integer which is less than or equal to x.  x  reads the floor of x Definition: The ceiling function .  :R → Z,  x  is the smallest integer which is greater than or equal to x.  x  reads the ceiling of x

9 Example Ceiling and Floor Functions Example:  -2.8  =  2.8  =  2.8  =  -2.8  =

10 Ceiling and Floor Properties Let n be an integer (1a)  x  = n if and only if n ≤ x < n+1 (1b)  x  = n if and only if n-1 < x ≤ n (1c)  x  = n if and only if x-1 < n ≤ x (1d)  x  = n if and only if x ≤ n < x+1 (2)x-1 <  x  ≤ x ≤  x  < x+1 (3a)  -x  = -  x  (3b)  -x  = -  x  (4a)  x+n  =  x  +n (4b)  x+n  =  x  +n

11 Ceiling and Floor Functions Let n be an integer, prove  x+n  =  x  +n Proof Let k =  x  Then k ≤ x < k+1 So k+n ≤ x+n < k+1+n I.e., k+n ≤ x+n < (k+n)+1 Since both k and n are integers, k+n is an integer Thus,  x+n  = k+n =  x  +n (by our choice of k) This concludes the proof This also concludes Chapter 2!

12 Boolean Algebras (Chapter 11) Boolean algebra provides the operations and the rules for working with the set {0, 1}. These are the rules that underlie electronic and optical circuits, and the methods we will discuss are fundamental to VLSI design.

13 Boolean Algebra The minimal Boolean algebra is the algebra formed over the set of truth values {0, 1} by using the operations functions +, ·, - (sum, product, and complement). The minimal Boolean algebra is equivalent to propositional logic where O corresponds to False 1 corresponds to True  corresponds logical operator AND + corresponds logical operator OR - corresponds logical operator NOT

14 Boolean Algebra Tables x0011x0011 y0101y0101 x + y 0 1 xy 0 1 x01x01 x10x10 x,y are Boolean variables – they assume values 0 or 1

15 Boolean n-Tuples Let B = {0, 1}, the set of Boolean values. Let B n = { (x 1,x 2,…x n ) | x i  B, i=1,..,n}. B 1= { (x 1 ) | x 1  B,} B 2= { (x 1, x 2 ), | x i  B, i=1,2} B n= { ((x 1,x 2,…x n ) | x i  B, i=1,..,n,} For all n  Z +, any function f:B n → B is called a Boolean function of degree n.

16 Example Boolean Function x x y y z z F(x,y,z)=x(y+z) F(x,y,z) =B 3  B B 3 has 8 triplets

17 Number of Boolean Functions How many different Boolean functions of degree 1 are there? How many different Boolean functions of degree 2 are there? How many different functions of degree n are there ? There are 2 2ⁿ distinct Boolean functions of degree n.