Notation Index. gcd(a, b) (greatest common divisor) NT-16

Size: px
Start display at page:

Download "Notation Index. gcd(a, b) (greatest common divisor) NT-16"

Transcription

1 Notation Index (for all) B A (all functions) B A = B A (all functions) SF-18 (n) k (falling factorial) SF-9 a R b (binary relation) C(n,k) = n! k! (n k)! (binomial coefficient) SF-9 n! (n factorial) SF-9 ( n ) k = n! k!(n k)! (binomial coefficient) SF-9 B n (Bell number) SF-11 χ (characteristic function) SF-10 (difference operator) IS-6 k n (k divides n; n/k Z) NT-2 x y (equivalence relation) EO-1! (for exactly one) (for some) Function χ (characteristic) SF-10 C(n,k) = ( n k) (binomial coefficient) SF-9 PER(A) = S(A) (permutations) SF-18 Coimage(f) SF-23 Image(f) SF-23 Function (particular) x (greatest integer) NT-9 x (ceiling) NT-9 gcd(a, b) (greatest common divisor) NT-16 φ(n) (Euler φ) NT-19 lcm(a,b) (least common multiple) NT-16 Function notation B A (all functions), SF-17, SF-18 f : A B (a function) BF-1, SF-15 f 1 (inverse, 1/f) SF-18 g f (composition) SF-20 gcd(a, b) (greatest common divisor) NT-16 lcm(a,b) (least common multiple) NT-16! (for exactly one) (for some) (for all) Logic notation (for some) Lo-13 (for all) Lo-12 (not) Lo-2 (and) Lo-2 (if and only if) Lo-6 (or) Lo-2 (if... then) Lo-5 x%d (x mod d) NT-7 N (Natural numbers) Lo-13, NT-1 n = {1,2,...,n} x C y (covering relation) EO-28 x y (order relation) EO-12 P (Prime numbers) Lo-13 P(A) (set of subsets of A) P k (A) (set of k-subsets of A) SF-9 SF-9 PER(A) = S(A) (permutations) SF-18 Q (Rational numbers) NT-1 R (Real numbers) Lo-13, NT-1 R(z) (real part of z) IS-24 Set notation {x : } (set description) SF-2 {x } (set description) SF-2 (empty set) SF-2 A (complement) SF-2 and (in and not in) SF-1 k A (k-fold product) SF-2 A (complement) SF-2 A B (difference) SF-2 A B (intersection) SF-2 A B (union) SF-2 A B (symmetric difference) SF-2 Index-1

2 A \ B (difference) SF-2 A B (subset) SF-1 A B (Cartesian product) SF-2 A c (complement) SF-2 P(A) (set of subsets of A) SF-9 P k (A) (set of k-subsets of A) SF-9 A (cardinality) SF-1 Sets of numbers N (Natural numbers) Lo-13, NT-1 N + (Positive integers) NT-1 N + 2 ({n Z n 2}) NT-1 P (Prime numbers) Lo-13, NT-2 Q (Rationals) NT-1 R (Real numbers) Lo-13, NT-1 Z (Integers) Lo-13, NT-1 n = {1,2,...,n} dz + k (residue class) NT-6 S(n,k) (Stirling number) SF-24 Z (Integers) Lo-13, NT-1 Index-2

3 Subject Index Index Absolute convergence IS-26 Absorption rule Adder full BF-19 half BF-18 BF-6, Lo-3, SF-3 Algebraic number theory NT-3 Algebraic rules for Boolean functions BF-6 predicate logic Lo-19 sequences IS-16 sets SF-2 statement forms Lo-3 Algorithm Euclidean NT-18 Alternating series IS-24 Dirichlet s Theorem IS-24 harmonic IS-23 And form BF-6 And operator (= ) BF-3 Antisymmetric relation EO-13 Arithmetic binary BF-12 computer BF-11 modular NT-6 two s complement BF-16 Associative law functional composition SF-20 Associative rule BF-6, Lo-3, SF-3 Base case (induction) IS-1 Base-b number BF-10 base change BF-10 binary (= base-2) BF-11 hexadecimal (= base-16) BF-11 octal (= base-8) BF-11 Bell number SF-11 Biconditional (= if and only if) Lo-6 Bijective function SF-18 Binary number BF-11 addition circuit BF-18 arithmetic BF-12 overflow BF-17 register size BF-14 two s complement BF-16 Binary operator BF-3 Binary relation EO-3 direct product of EO-18 Binomial coefficient Pascal s triangle SF-10 recursion SF-10 Binomial coefficient: C(n, k) = ( n k) SF-9 Block of a partition SF-11 Boolean operator, see also operator product (= ) EO-27 sum (= ) EO-27 Boolean function BF-1 number of BF-2 tabular form BF-1 Bound rule BF-6, Lo-3 Bounded sequence IS-16 monotone converge IS-17 Bucket sort EO-22 Cardinality of a set SF-1 Cartesian product of sets SF-2 Ceiling function (= least integer) NT-9 Chain (= linear order) EO-14 length of EO-29 Characteristic function SF-10 Ciphertext NT-13 Circuit for addition BF-18 Codomain of a function BF-1, SF-15 Index-3

4 Coimage of a function SF-23 set partition SF-23 Commutative rule BF-6, Lo-3, SF-3 Comparable elements EO-14 Comparison sort EO-22 Complement of a set SF-2 Composite number Lo-13, NT-2 Composition of functions SF-20, SF-20 associative law SF-20 Computer arithmetic addition circuit BF-18 negative number BF-16 overflow BF-14, BF-17 register size BF-14 two s complement BF-16 Conditional (= if... then) Lo-5 Conditional convergence IS-27 Conjecture Goldbach s Lo-13 Twin Prime Lo-16 Conjunctive normal form BF-6 Contradiction Lo-2 Contrapositive Lo-6 Convergence only tails matter IS-13 sequence IS-13 sequence alternate form IS-14 sequence bounded monotone IS-17 sequence to infinity IS-19 series IS-20 series Abel s Theorem IS-28 series absolute IS-26 series conditional IS-27 series general harmonic IS-25 series integral test IS-24 Converse Lo-6 Coordinate order (= direct product) EO-17 Countable set NT-5 Covering relation EO-28 Cryptography NT-13, SF-19 Diffie-Hellman protocol NT-22 PGP NT-20 public key NT-21 RSA protocol NT-23 symmetric encryption NT-20 trapdoor function NT-21 Cycle form of a permutation SF-22 Decreasing sequence IS-17 DeMorgan s rule DES (= Data Encryption Standard) SF-19 Diagonal argument NT-6 Diagram, Hasse BF-6, Lo-3, SF-3 EO-28 Dictionary order (= lex order) SF-8 Difference of sets SF-2 symmetric SF-2 Difference operator IS-6 Diffie-Hellman protocol NT-22 Digit symbol of index i BF-10 Direct product of binary relations EO-18 Direct product of posets EO-17 Directed graph diagrams EO-26 Discrete logarithm NT-21 Diffie-Hellman and NT-22 Disjunctive normal form BF-5 Distributive rule BF-6, Lo-3, SF-3 Divergence only tails matter IS-13 sequence IS-13 sequence to infinity IS-19 series IS-21 series to infinity IS-21 Divisible by: k n NT-2 Domain of a function BF-1, SF-15 Domino coverings EO-24 Double implication (= if and only if) Lo-6 Index-4

5 Double negation rule BF-6, Lo-3, SF-3 Element in poset greatest EO-29 least EO-29 maximal EO-30 minimal EO-30 Element method of proof SF-4 Elements (of a poset) comparable EO-14 incomparable EO-14 Empty set SF-2 Encryption SF-19 English to logic for all Lo-12 for some Lo-13 if and only if Lo-7 method for implication necessary Lo-7 neither BF-8 only if Lo-7 requires Lo-8 sufficient Lo-7 there exists Lo-13 unless Lo-8 Envelope game SF-17 Equivalence class EO-1 Equivalence relation EO-1 Espionage NT-15 Euclidean algorithm NT-18 Euler φ function NT-19 RSA protocol and NT-23 Even integer NT-1 Lo-8 Exclusive or operator (= ) BF-3 Existential quantifier ( ) Lo-13 Exponential, rate of growth of IS-18 Extension, linear EO-30 Factorial falling SF-9 Factoring RSA and NT-23 uniqueness of NT-3 Falling factorial SF-9 Fermat number Lo-16 Fermat s Last Theorem Lo-18, NT-3 Floor function (= greatest integer) NT-9 For all (logic: ) Lo-12 For some (logic: ) Lo-13 Full adder BF-19 Function BF-1, SF-15 bijective SF-18 binomial coefficient: ( n k) = C(n, k) SF-9 Boolean BF-1 Boolean, number of BF-2 ceiling (= least integer: x ) NT-9 characteristic: χ SF-10 codomain (= range) of BF-1, SF-15 coimage and set partition SF-23 coimage of SF-23 composition of SF-20, SF-20 domain of BF-1, SF-15 Euler φ NT-19 Euler φ and RSA protocol NT-23 floor (= greatest integer: x ) NT-9 greatest common divisor (= gcd) NT-16 greatest integer NT-9 hash SF-19 image of SF-15, SF-23 injective SF-18 inverse SF-18, SF-23 least common multiple (= lcm) NT-16 least integer NT-9 number of SF-18 number of = ( n k) S(m,k) k! SF-25 one-line notation for, Index-5

6 one-to-one (= injection) SF-18 one-way (= trapdoor) NT-21 onto (= surjection) SF-18 permutation SF-18 range (= codomain) of BF-1, SF-15 surjective SF-18 trapdoor NT-21 two-line notation for SF-20, SF-20 Functional relation Gate BF-18 Geometric series IS-22 Goldbach s conjecture Lo-13 Graph diagrams, directed EO-26 Greatest common divisor (= gcd) NT-16 Euclidean algorithm NT-18 Greatest element in poset EO-29 Greatest integer function NT-9 Half adder BF-18 Harmonic series IS-22 alternating IS-23 general IS-25 Hashing SF-19 Hasse diagram EO-28 Hexadecimal number BF-11 Idempotent rule BF-6, Lo-3, SF-3 If... then Lo-5 If and only if (logic) Lo-7 Image of a function SF-15, SF-23 Implication Lo-5 Incidence matrix EO-14 Incomparable elements EO-14 Incomparable subsets EO-14 Increasing sequence IS-17 Induction terminology IS-1 Inductive step Infinite sequence see Sequence Infinite series see Series IS-1 Injective function SF-18 Integral test for series IS-24 Intersection of sets SF-2 Inverse Lo-6 Inverse function SF-18 Inverse relation Irrationality of square root NT-4 Key (cryptography) NT-13 Diffie-Hellman NT-22 RSA and public NT-23 trapdoor function and NT-21 Lattice of subsets EO-13 Least common multiple (= lcm) NT-16 Least element in poset EO-29 Least integer function NT-9 Length-first lex order EO-21 Lexicographic bucket sort EO-22 Lexicographic order (= lex order) SF-7, EO-19 length-first (= short) EO-21 Limit of a sequence IS-13 sum of infinite series IS-20 Linear extension EO-30 Linear order SF-1, EO-14 List (= ordered set) SF-1 Logarithm discrete and Diffie- Hellman NT-22 Logarithm, rate of growth of IS-18 Logic predicate Lo-12 propositional BF-4, Lo-1 Index-6

7 Logic gate BF-18 Matrix, incidence EO-14 Maximal element in poset EO-30 Mersenne number Lo-17 Minimal element in poset EO-30 Mod as binary operator NT-7 Mod as equivalence relation NT-7 Modular arithmetic NT-6 Monotone sequence IS-17 Monotone subsequences EO-8 Necessary (logic) Lo-7 Negation rule BF-6, Lo-3 Normal form conjunctive BF-6 disjunctive BF-5 Not operator (= ) BF-3 Number base-b BF-10 Bell number: B n SF-11 binomial coefficient: ( n k) = C(n, k) SF-9 composite Lo-13, NT-2 Fermat: F n Lo-16 integer Z NT-1 integer: Z Lo-13 irrational: R Q NT-1 Mersenne: M p Lo-17 natural N NT-1 natural: N Lo-13 perfect Lo-17 prime Lo-13 prime: P Lo-13, NT-2 rational: Q NT-1 real: R Lo-13, NT-1 square root is irrational NT-4 Stirling: S(n, k) SF-24 unique prime factorization of NT-3 Number theory algebraic NT-3 elementary Lo-13 nonunique factorization NT-3 Octal number BF-11 Odd integer NT-1 One-line notation, One-to-one function (= injection) SF-18 One-way (= trapdoor) function NT-21 Only if (logic) Lo-7 Onto function (= surjection) SF-18 Operator and (= ) BF-3 binary BF-3 exclusive or (= ) BF-3 not (= ) BF-3 or (= ) BF-3 unary BF-3 Or form BF-5 Or operator (= ) BF-3 Order coordinate (= direct product) EO-17 dictionary (= lex) SF-8 lex (= lexicographic) SF-7 lexicographic EO-19 linear SF-1 relation SF-8 Order relation EO-12 Ordered set SF-1 Overflow BF-14, BF-17 Partially ordered set see poset Partition of a set SF-11 block of SF-11 function coimage and SF-23 number of SF-11, SF-24 refinement of SF-11 Pascal s triangle SF-10 Index-7

8 Perfect number Lo-17 Perfect square NT-4 Permutation SF-18 cycle SF-22 cycle form SF-22 cycle length SF-22 PGP (= Pretty Good Privacy) NT-20, SF-19 Pigeonhole principle extended EO-7 Plaintext NT-13 EO-5 Polynomial, rate of growth of IS-18 Poset EO-13 comparable elements EO-14 coordinate (= direct product) order EO-17 covering relation EO-28 direct product of EO-17 divisibility EO-14, EO-19 greatest element EO-29 incomparable elements EO-14 isomorphic EO-18 least element EO-29 lex order EO-19 linear (= total) order EO-14 maximal element EO-30 minimal element EO-30 restriction of (= subposet) EO-17 subset lattice EO-13, EO-17 Power set SF-9, EO-13 Powers sum of IS-5 Predicate logic algebraic rules Lo-19 predicate Lo-12 quantifier Lo-12 truth set Lo-12 Prime factorization NT-3, IS-2 uniqueness of NT-3 Prime number Lo-13, NT-2 how common? IS-28 infinitely many NT-4 unique factorization into NT-3 Prime Number Theorem IS-28 Principle extended pigeonhole EO-7 pigeonhole EO-5 Product of sets SF-2 Propositional logic BF-4, Lo-1 algebraic rules Lo-3 Public key cryptography NT-21 PGP NT-20 RSA protocol NT-23 Quantifier existential ( ) Lo-13 negation of Lo-15 universal ( ) Lo-12 Range of a function BF-1, SF-15 Rate of growth IS-18 Refinement of set partition SF-11, EO-16 Reflexive relation EO-3, EO-13 Relation antisymmetric EO-13 binary EO-3 covering EO-28 equivalence EO-1 functional inverse number of EO-15 order SF-8, EO-12 reflexive EO-3, EO-13 symmetric EO-3 transitive EO-3, EO-13 transitive closure of EO-26 Residue class (modular arithmetic) NT-6 Restriction of a poset (= subposet) EO-17 RSA protocol NT-23 Index-8

9 Rule absorption BF-6, Lo-3, SF-3 associative BF-6, Lo-3, SF-3 bound BF-6, Lo-3 commutative BF-6, Lo-3, SF-3 DeMorgan s BF-6, Lo-3, SF-3 distributive BF-6, Lo-3, SF-3 double negation BF-6, Lo-3, SF-3 idempotent BF-6, Lo-3, SF-3 negation BF-6, Lo-3 Sequence IS-12 algebraic rules for IS-16 bounded IS-16 convergent IS-13 convergent to infinity IS-19 decreasing IS-17 divergent IS-13 divergent to infinity IS-19 increasing IS-17 limit of IS-13 monotone IS-17 series and IS-20 tail of IS-12 term of IS-12 Series IS-20 Abel s Theorem IS-28 absolute convergence IS-26 alternating IS-24 alternating harmonic IS-23 conditional convergence IS-27 convergent IS-20 convergent and small terms IS-21 Dirichlet s Theorem IS-24 divergent IS-21 general harmonic IS-25 geometric IS-22 harmonic IS-22 integral test for monotone IS-24 partial sums IS-20 sum is a limit IS-20 tail of IS-20 Set SF-1 algebraic method SF-5 algebraic rules SF-2 as a predicate Lo-14 Bell number: B n SF-11 cardinality of SF-1 Cartesian product SF-2 characteristic function SF-10 complement SF-2 countable NT-5 difference SF-2 element method SF-4 empty SF-2 intersection SF-2 number of subsets SF-11 ordered SF-1 partially ordered EO-13 power SF-9, EO-13 subset SF-1 symmetric difference SF-2 union SF-2 universal SF-1 Venn diagrams SF-3 Set inclusion order EO-13 Set partition SF-11 block of SF-11 function coimage and SF-23 refinement poset EO-16 refining SF-11 Stirling number: S(n, k) SF-24 Sort bucket EO-22 comparison EO-22 topological (= linear extension) EO-30 Statement form Lo-1 Boolean function and Lo-8 Statement variable BF-3, Lo-1 Stirling number S(n,k) SF-24 String (= ordered set) SF-1 Subposet EO-17 Subset lattice EO-13 Subset of a set SF-1 number of them SF-11 Subset sums EO-6 Index-9

10 Sufficient (logic) Lo-7 Sum of powers IS-5 Sums equal EO-6 equal subset EO-6 Surjective function SF-18 Symmetric difference of sets SF-2 Symmetric encryption NT-20 Symmetric relation EO-3 Tabular form of a Boolean function BF-1 Tail and convergence IS-13 sequence IS-12 series IS-20 Tautology Lo-2 Term of a sequence IS-12 series IS-20 Theorem Abel s IS-28 algebraic rules, see Algebraic rules Pigeonhole Principle EO-5 Pigeonhole Principle, extended EO-7 Prime Number IS-28 sequence convergence, see Convergence Unique Factorization NT-3 There exists (logic: ) Tiling problem EO-24 Topological sort EO-30 Lo-13 Total order (= linear order) EO-14 Transitive closure EO-26 Transitive relation EO-3, EO-13 Trapdoor function NT-21 discrete logarithm NT-22 Truth set (predicate logic) Lo-12 Truth table BF-2, BF-4, Lo-2 Twin Prime conjecture Lo-16 Two-line notation SF-20, SF-20 Two s complement BF-16 arithmetic BF-16 overflow BF-17 Unary operator BF-3 Union of sets SF-2 Unique prime factorization NT-3 Universal quantifier ( ) Lo-12 Universal set SF-1 Unless (logic) Lo-8 Vector (= ordered set) SF-1 Venn diagrams for sets SF-3 Word (= ordered set) SF-1 Index-10

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

More information

Chapter 1 : The language of mathematics.

Chapter 1 : The language of mathematics. MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :

More information

Part IA Numbers and Sets

Part IA Numbers and Sets Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

MATH 363: Discrete Mathematics

MATH 363: Discrete Mathematics MATH 363: Discrete Mathematics Learning Objectives by topic The levels of learning for this class are classified as follows. 1. Basic Knowledge: To recall and memorize - Assess by direct questions. The

More information

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,

More information

Propositional Logic, Predicates, and Equivalence

Propositional Logic, Predicates, and Equivalence Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If

More information

Multiple Choice Questions for Review

Multiple Choice Questions for Review Equivalence and Order Multiple Choice Questions for Review In each case there is one correct answer (given at the end of the problem set). Try to work the problem first without looking at the answer. Understand

More information

REVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms

REVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms REVIEW QUESTIONS Chapter 1: Foundations: Sets, Logic, and Algorithms 1. Why can t a Venn diagram be used to prove a statement about sets? 2. Suppose S is a set with n elements. Explain why the power set

More information

7.11 A proof involving composition Variation in terminology... 88

7.11 A proof involving composition Variation in terminology... 88 Contents Preface xi 1 Math review 1 1.1 Some sets............................. 1 1.2 Pairs of reals........................... 3 1.3 Exponentials and logs...................... 4 1.4 Some handy functions......................

More information

MATH1240 Definitions and Theorems

MATH1240 Definitions and Theorems MATH1240 Definitions and Theorems 1 Fundamental Principles of Counting For an integer n 0, n factorial (denoted n!) is defined by 0! = 1, n! = (n)(n 1)(n 2) (3)(2)(1), for n 1. Given a collection of n

More information

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical

More information

Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland

Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................

More information

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is 1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,

More information

Sets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth

Sets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth Sets We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth century. Most students have seen sets before. This is intended

More information

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus

More information

CS Discrete Mathematics Dr. D. Manivannan (Mani)

CS Discrete Mathematics Dr. D. Manivannan (Mani) CS 275 - Discrete Mathematics Dr. D. Manivannan (Mani) Department of Computer Science University of Kentucky Lexington, KY 40506 Course Website: www.cs.uky.edu/~manivann/cs275 Notes based on Discrete Mathematics

More information

Mathematics Review for Business PhD Students

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

More information

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is

More information

MA Discrete Mathematics

MA Discrete Mathematics MA2265 - Discrete Mathematics UNIT I 1. Check the validity of the following argument. If the band could not play rock music or the refreshments were not delivered on time, then the New year s party would

More information

CSE 1400 Applied Discrete Mathematics Proofs

CSE 1400 Applied Discrete Mathematics Proofs CSE 1400 Applied Discrete Mathematics Proofs Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Axioms 1 Logical Axioms 2 Models 2 Number Theory 3 Graph Theory 4 Set Theory 4

More information

DISCRETE STRUCTURES AMIN WITNO

DISCRETE STRUCTURES AMIN WITNO DISCRETE STRUCTURES AMIN WITNO p h i. w i t n o. c o m Discrete Structures Revision Notes and Problems Amin Witno Preface These notes were prepared for students as a revision workbook

More information

Part IA Numbers and Sets

Part IA Numbers and Sets Part IA Numbers and Sets Theorems Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is

More information

MATH 310 Course Objectives

MATH 310 Course Objectives MATH 310 Course Objectives Upon successful completion of MATH 310, the student should be able to: Apply the addition, subtraction, multiplication, and division principles to solve counting problems. Apply

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

A Semester Course in Basic Abstract Algebra

A Semester Course in Basic Abstract Algebra A Semester Course in Basic Abstract Algebra Marcel B. Finan Arkansas Tech University c All Rights Reserved December 29, 2011 1 PREFACE This book is an introduction to abstract algebra course for undergraduates

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents

More information

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical

More information

Copyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction

Copyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction Copyright & License Copyright c 2007 Jason Underdown Some rights reserved. statement sentential connectives negation conjunction disjunction implication or conditional antecedant & consequent hypothesis

More information

Simplification by Truth Table and without Truth Table

Simplification by Truth Table and without Truth Table Engineering Mathematics 2013 SUBJECT NAME SUBJECT CODE MATERIAL NAME MATERIAL CODE REGULATION UPDATED ON : Discrete Mathematics : MA2265 : University Questions : SKMA1006 : R2008 : August 2013 Name of

More information

Mathematics Review for Business PhD Students Lecture Notes

Mathematics Review for Business PhD Students Lecture Notes Mathematics Review for Business PhD Students Lecture Notes Anthony M. Marino Department of Finance and Business Economics Marshall School of Business University of Southern California Los Angeles, CA 90089-0804

More information

Discrete Math Notes. Contents. William Farmer. April 8, Overview 3

Discrete Math Notes. Contents. William Farmer. April 8, Overview 3 April 8, 2014 Contents 1 Overview 3 2 Principles of Counting 3 2.1 Pigeon-Hole Principle........................ 3 2.2 Permutations and Combinations.................. 3 2.3 Binomial Coefficients.........................

More information

CSE 1400 Applied Discrete Mathematics Definitions

CSE 1400 Applied Discrete Mathematics Definitions CSE 1400 Applied Discrete Mathematics Definitions Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Arithmetic 1 Alphabets, Strings, Languages, & Words 2 Number Systems 3 Machine

More information

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic

CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic CHAPER 1 MAHEMAICAL LOGIC 1.1 undamentals of Mathematical Logic Logic is commonly known as the science of reasoning. Some of the reasons to study logic are the following: At the hardware level the design

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics Dr. Thomas Baird January 7, 2013 Contents 1 Logic 2 1.1 Statements.................................... 2 1.1.1 And, Or, Not.............................. 2 1.1.2 Implication...............................

More information

HANDOUT AND SET THEORY. Ariyadi Wijaya

HANDOUT AND SET THEORY. Ariyadi Wijaya HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics

More information

Tutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement

Tutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement Tutorial - 1 1. Obtain the principal disjunctive normal form and principal conjunction form of the statement Let S P P Q Q R P P Q Q R A: P Q Q R P Q R P Q Q R Q Q R A S Minterm Maxterm T T T F F T T T

More information

Simplification by Truth Table and without Truth Table

Simplification by Truth Table and without Truth Table SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : University Questions : R2013 UPDATED ON : June 2017 (Scan the above Q.R code for the direct download of this material)

More information

Propositional Logic. What is discrete math? Tautology, equivalence, and inference. Applications

Propositional Logic. What is discrete math? Tautology, equivalence, and inference. Applications What is discrete math? Propositional Logic The real numbers are continuous in the senses that: between any two real numbers there is a real number The integers do not share this property. In this sense

More information

Florida State University Course Notes MAD 2104 Discrete Mathematics I

Florida State University Course Notes MAD 2104 Discrete Mathematics I Florida State University Course Notes MAD 2104 Discrete Mathematics I Florida State University Tallahassee, Florida 32306-4510 Copyright c 2011 Florida State University Written by Dr. John Bryant and Dr.

More information

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Packet #1: Logic & Proofs. Applied Discrete Mathematics Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should

More information

Logic Synthesis and Verification

Logic Synthesis and Verification Logic Synthesis and Verification Boolean Algebra Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 2014 1 2 Boolean Algebra Reading F. M. Brown. Boolean Reasoning:

More information

Sets McGraw-Hill Education

Sets McGraw-Hill Education Sets A set is an unordered collection of objects. The objects in a set are called the elements, or members of the set. A set is said to contain its elements. The notation a A denotes that a is an element

More information

MaanavaN.Com MA1256 DISCRETE MATHEMATICS. DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : MA1256 DISCRETE MATHEMATICS

MaanavaN.Com MA1256 DISCRETE MATHEMATICS. DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : MA1256 DISCRETE MATHEMATICS DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : UNIT I PROPOSITIONAL CALCULUS Part A ( Marks) Year / Sem : III / V. Write the negation of the following proposition. To enter into the country you

More information

Sets and Motivation for Boolean algebra

Sets and Motivation for Boolean algebra SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of

More information

Simplification by Truth Table and without Truth Table

Simplification by Truth Table and without Truth Table SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : University Questions : R2013 UPDATED ON : April-May 2018 BOOK FOR REFERENCE To buy the book visit : Sri Hariganesh

More information

Automata Theory and Formal Grammars: Lecture 1

Automata Theory and Formal Grammars: Lecture 1 Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)

More information

Set Basics. P. Danziger

Set Basics. P. Danziger - 5 Set Basics P. Danziger 1 Set Basics Definition 1 (Cantor) A set is a collection into a whole of definite and separate objects of our intuition or thought. (Russell) Such that given an object x and

More information

Problem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.

Problem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B. Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination III (Spring 2007) Problem 1: Suppose A, B, C and D are finite sets

More information

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The

More information

B.C.S.Part I Mathematics (Sem.- I & II) Syllabus to be implemented from June 2013 onwards.

B.C.S.Part I Mathematics (Sem.- I & II) Syllabus to be implemented from June 2013 onwards. B.C.S.Part I Mathematics (Sem.- I & II) Syllabus to be implemented from June 2013 onwards. 1. TITLE: Subject Mathematics 2. YEAR OF IMPLEMENTATION : Revised Syllabus will be implemented from June 2013

More information

MATH 2200 Final Review

MATH 2200 Final Review MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics

More information

MATH 2200 Final LC Review

MATH 2200 Final LC Review MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from

More information

Contents Propositional Logic: Proofs from Axioms and Inference Rules

Contents Propositional Logic: Proofs from Axioms and Inference Rules Contents 1 Propositional Logic: Proofs from Axioms and Inference Rules... 1 1.1 Introduction... 1 1.1.1 An Example Demonstrating the Use of Logic in Real Life... 2 1.2 The Pure Propositional Calculus...

More information

Florida State University Course Notes MAD 2104 Discrete Mathematics I

Florida State University Course Notes MAD 2104 Discrete Mathematics I Florida State University Course Notes MAD 2104 Discrete Mathematics I Florida State University Tallahassee, Florida 32306-4510 Copyright c 2004 Florida State University Written by Dr. John Bryant and Dr.

More information

Exploring the infinite : an introduction to proof and analysis / Jennifer Brooks. Boca Raton [etc.], cop Spis treści

Exploring the infinite : an introduction to proof and analysis / Jennifer Brooks. Boca Raton [etc.], cop Spis treści Exploring the infinite : an introduction to proof and analysis / Jennifer Brooks. Boca Raton [etc.], cop. 2017 Spis treści Preface xiii I Fundamentals of Abstract Mathematics 1 1 Basic Notions 3 1.1 A

More information

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203. DEPARTMENT OF COMPUTER SCIENCE ENGINEERING SUBJECT QUESTION BANK : MA6566 \ DISCRETE MATHEMATICS SEM / YEAR: V / III year CSE. UNIT I -

More information

Discrete Mathematics & Mathematical Reasoning Course Overview

Discrete Mathematics & Mathematical Reasoning Course Overview Discrete Mathematics & Mathematical Reasoning Course Overview Colin Stirling Informatics Colin Stirling (Informatics) Discrete Mathematics Today 1 / 19 Teaching staff Lecturers: Colin Stirling, first half

More information

BOOLEAN ALGEBRA INTRODUCTION SUBSETS

BOOLEAN ALGEBRA INTRODUCTION SUBSETS BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations

More information

D I S C R E T E M AT H E M AT I C S H O M E W O R K

D I S C R E T E M AT H E M AT I C S H O M E W O R K D E PA R T M E N T O F C O M P U T E R S C I E N C E S C O L L E G E O F E N G I N E E R I N G F L O R I D A T E C H D I S C R E T E M AT H E M AT I C S H O M E W O R K W I L L I A M S H O A F F S P R

More information

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!! CSCE 222 Discrete Structures for Computing Review for Exam 1 Dr. Hyunyoung Lee 1 Topics Propositional Logic (Sections 1.1, 1.2 and 1.3) Predicate Logic (Sections 1.4 and 1.5) Rules of Inferences and Proofs

More information

A is a subset of (contained in) B A B iff x A = x B Socrates is a man. All men are mortal. A = B iff A B and B A. A B means A is a proper subset of B

A is a subset of (contained in) B A B iff x A = x B Socrates is a man. All men are mortal. A = B iff A B and B A. A B means A is a proper subset of B Subsets C-N Math 207 - Massey, 71 / 125 Sets A is a subset of (contained in) B A B iff x A = x B Socrates is a man. All men are mortal. A = B iff A B and B A x A x B A B means A is a proper subset of B

More information

Sets. Subsets. for any set A, A and A A vacuously true: if x then x A transitivity: A B, B C = A C N Z Q R C. C-N Math Massey, 72 / 125

Sets. Subsets. for any set A, A and A A vacuously true: if x then x A transitivity: A B, B C = A C N Z Q R C. C-N Math Massey, 72 / 125 Subsets Sets A is a subset of (contained in) B A B iff x A = x B Socrates is a man. All men are mortal. A = B iff A B and B A x A x B A B means A is a proper subset of B A B but A B, so x B x / A Illustrate

More information

Handbook of Logic and Proof Techniques for Computer Science

Handbook of Logic and Proof Techniques for Computer Science Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives

More information

Review Sheet for the Final Exam of MATH Fall 2009

Review Sheet for the Final Exam of MATH Fall 2009 Review Sheet for the Final Exam of MATH 1600 - Fall 2009 All of Chapter 1. 1. Sets and Proofs Elements and subsets of a set. The notion of implication and the way you can use it to build a proof. Logical

More information

Logic. Facts (with proofs) CHAPTER 1. Definitions

Logic. Facts (with proofs) CHAPTER 1. Definitions CHAPTER 1 Logic Definitions D1. Statements (propositions), compound statements. D2. Truth values for compound statements p q, p q, p q, p q. Truth tables. D3. Converse and contrapositive. D4. Tautologies

More information

2MA105 Algebraic Structures I

2MA105 Algebraic Structures I 2MA105 Algebraic Structures I Per-Anders Svensson http://homepage.lnu.se/staff/psvmsi/2ma105.html Lecture 12 Partially Ordered Sets Lattices Bounded Lattices Distributive Lattices Complemented Lattices

More information

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations

UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS 2013 MATH 122: Logic and Foundations Instructor and section (check one): K. Mynhardt [A01] CRN 12132 G. MacGillivray [A02] CRN 12133 NAME: V00#: Duration: 3

More information

Math 13, Spring 2013, Lecture B: Midterm

Math 13, Spring 2013, Lecture B: Midterm Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.

More information

MATH 115 Concepts in Mathematics

MATH 115 Concepts in Mathematics South Central College MATH 115 Concepts in Mathematics Course Outcome Summary Course Information Description Total Credits 4.00 Total Hours 64.00 Concepts in Mathematics is a general education survey course

More information

Foundations of Mathematics

Foundations of Mathematics Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object

More information

2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.

2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. 2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is

More information

Chapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60

Chapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60 MATH 213 Chapter 2: Basic Structures Dr. Eric Bancroft Fall 2013 Dr. Eric Bancroft MATH 213 Fall 2013 1 / 60 Chapter 2 - Basics Structures 2.1 - Sets 2.2 - Set Operations 2.3 - Functions 2.4 - Sequences

More information

STUDY GUIDE FOR THE WRECKONING. 1. Combinatorics. (1) How many (positive integer) divisors does 2940 have? What about 3150?

STUDY GUIDE FOR THE WRECKONING. 1. Combinatorics. (1) How many (positive integer) divisors does 2940 have? What about 3150? STUDY GUIDE FOR THE WRECKONING. Combinatorics Go over combinatorics examples in the text. Review all the combinatorics problems from homework. Do at least a couple of extra problems given below. () How

More information

Boolean Algebra CHAPTER 15

Boolean Algebra CHAPTER 15 CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an

More information

Introduction to Number Theory

Introduction to Number Theory INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,

More information

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) (2011 Admission Onwards) I Semester Core Course FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK 1) If A and B are two sets

More information

Math 109 September 1, 2016

Math 109 September 1, 2016 Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,

More information

Theorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers

Theorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower

More information

CSE 20 Discrete Math. Algebraic Rules for Propositional Formulas. Summer, July 11 (Day 2) Number Systems/Computer Arithmetic Predicate Logic

CSE 20 Discrete Math. Algebraic Rules for Propositional Formulas. Summer, July 11 (Day 2) Number Systems/Computer Arithmetic Predicate Logic CSE 20 Discrete Math Algebraic Rules for Propositional Formulas Equivalences between propositional formulas (similar to algebraic equivalences): Associative Summer, 2006 July 11 (Day 2) Number Systems/Computer

More information

Chapter 2 - Basics Structures

Chapter 2 - Basics Structures Chapter 2 - Basics Structures 2.1 - Sets Definitions and Notation Definition 1 (Set). A set is an of. These are called the or of the set. We ll typically use uppercase letters to denote sets: S, A, B,...

More information

Background for Discrete Mathematics

Background for Discrete Mathematics Background for Discrete Mathematics Huck Bennett Northwestern University These notes give a terse summary of basic notation and definitions related to three topics in discrete mathematics: logic, sets,

More information

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics.

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory

More information

Discrete Mathematics. Benny George K. September 22, 2011

Discrete Mathematics. Benny George K. September 22, 2011 Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and

More information

Compound Propositions

Compound Propositions Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth

More information

Contents. Preface to the First Edition. Preface to the Second Edition. Preface to the Third Edition

Contents. Preface to the First Edition. Preface to the Second Edition. Preface to the Third Edition Contents Preface to the First Edition Preface to the Second Edition Preface to the Third Edition i iii iv Glossary of Symbols A. Prime Numbers 3 A1. Prime values of quadratic functions. 7 A2. Primes connected

More information

Name (please print) Mathematics Final Examination December 14, 2005 I. (4)

Name (please print) Mathematics Final Examination December 14, 2005 I. (4) Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,

More information

Review CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.

Review CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2. CHAPTER 2 Review 2.1 Definitions in Chapter 2 2.1 Set; Element; Member; Universal Set 2.2 Subset 2.3 Proper Subset 2.4 The Empty Set, 2.5 Set Equality 2.6 Cardinality; Infinite Set 2.7 Complement 2.8 Intersection

More information

Week Some Warm-up Questions

Week Some Warm-up Questions 1 Some Warm-up Questions Week 1-2 Abstraction: The process going from specific cases to general problem. Proof: A sequence of arguments to show certain conclusion to be true. If... then... : The part after

More information

Math 10850, fall 2017, University of Notre Dame

Math 10850, fall 2017, University of Notre Dame Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need

More information

CSCE 222 Discrete Structures for Computing

CSCE 222 Discrete Structures for Computing CSCE 222 Discrete Structures for Computing Sets and Functions Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Sets Sets are the most fundamental discrete structure on which all other discrete

More information

Equivalence relations

Equivalence relations Equivalence relations R A A is an equivalence relation if R is 1. reflexive (a, a) R 2. symmetric, and (a, b) R (b, a) R 3. transitive. (a, b), (b, c) R (a, c) R Example: Let S be a relation on people

More information

Prof. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even.

Prof. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even. 1. Show that if A and B are countable, then A B is also countable. Hence, prove by contradiction, that if X is uncountable and a subset A is countable, then X A is uncountable. Solution: Suppose A and

More information

Review 3. Andreas Klappenecker

Review 3. Andreas Klappenecker Review 3 Andreas Klappenecker Final Exam Friday, May 4, 2012, starting at 12:30pm, usual classroom Topics Topic Reading Algorithms and their Complexity Chapter 3 Logic and Proofs Chapter 1 Logic and Proofs

More information

Algorithms: Background

Algorithms: Background Algorithms: Background Amotz Bar-Noy CUNY Amotz Bar-Noy (CUNY) Algorithms: Background 1 / 66 What is a Proof? Definition I: The cogency of evidence that compels acceptance by the mind of a truth or a fact.

More information