ICS141: Discrete Mathematics for Computer Science I
|
|
- Ophelia Douglas
- 5 years ago
- Views:
Transcription
1 ICS4: Discrete Mathematics for Computer Sciece I Dept. Iformatio & Computer Sci., Ja Stelovsky based o slides by Dr. aek ad Dr. Still Origials by Dr. M. P. Frak ad Dr. J.L. Gross Provided by McGraw-Hill ICS 4: Discrete Mathematics I Fall 2 9-
2 Lecture 9 Chapter 2. asic Structures 2.2 Set Operatios ICS 4: Discrete Mathematics I Fall 2 9-2
3 Set Idetities Idetity: U Domiatio: U U, Idempotet:, Double complemet: () Commutative:, ssociative: ( C) ( ) C, ( C) ( ) C Distributive: ( C) ( ) ( C), ( C) ( ) ( C) bsorptio: ( ), ( ) Complemet: U, ICS 4: Discrete Mathematics I Fall 2 9-3
4 DeMorga s Law for Sets Eactly aalogous to (ad provable from) DeMorga s Law for propositios. ICS 4: Discrete Mathematics I Fall 2 9-4
5 Provig Set Idetities To prove statemets about sets, of the form E E 2 (where the Es are set epressios), here are three useful techiques:. Prove E E 2 ad E 2 E separately. 2. Use set builder otatio & logical equivaleces. 3. Use a membership table. 4. Use a Ve diagram. ICS 4: Discrete Mathematics I Fall 2 9-5
6 Method : Mutual Subsets Eample: Show ( C) ( ) ( C). Part : Show ( C) ( ) ( C). ssume (C), & show ()(C). We kow that, ad either or C. Case : ad. The, so ()(C). Case 2: ad C. The C, so ()(C). Therefore, ()(C). Therefore, (C) ()(C). Part 2: Show ()(C) (C). (Try it!) ICS 4: Discrete Mathematics I Fall 2 9-6
7 9-7 ICS 4: Discrete Mathematics I Fall 2 Method 2: Set uilder Notatio & Logical Equivalece Show def. of complemet def. of does ot belog def. of itersectio De Morga s law (logic) def. of does ot belog def. of complemet def. of uio by set builder otatio } } } )} ( ) ( )} ( ))} ( ( )} (
8 Method 3: Membership Tables alog to truth tables i propositioal logic. Colums for differet set epressios. Rows for all combiatios of memberships i costituet sets. Use to idicate membership i the derived set, for o-membership. Prove equivalece with idetical colums. ICS 4: Discrete Mathematics I Fall 2 9-8
9 Membership Table Eample Prove ( ) - -. () ICS 4: Discrete Mathematics I Fall 2 9-9
10 Membership Table Eercise Prove ( ) - C ( - C) ( - C). C () C C C ( C)( C) ICS 4: Discrete Mathematics I Fall 2 9-
11 Method 4: Ve Diagram Prove ( ) - C ( - C) ( - C). C ( ) C C C C C C C ( C) ( C) ICS 4: Discrete Mathematics I Fall 2 9-
12 Geeralized Uios & Itersectios Sice uio & itersectio are commutative ad associative, we ca eted them from operatig o pairs of sets ad to operatig o sequeces of sets,,, or eve o sets of sets, X P()}. ICS 4: Discrete Mathematics I Fall 2 9-2
13 Geeralized Uio iary uio operator: -ary uio: 2 (( (( 2 ) ) ) (groupig & order is irrelevat) ig U otatio: i More geerally, uio of the sets i for i I: i i I i For ifiite umber of sets: i i ICS 4: Discrete Mathematics I Fall 2 9-3
14 9-4 ICS 4: Discrete Mathematics I Fall 2 +,2,3,...},2,3},2} } 3 2 i i Geeralized Uio Eamples Let i i, i+, i+2, }. The, Let i, 2, 3,,i } for i, 2, 3,. The,,2,3,...} 2,...},, 2,3,4,...},2,3,...} i i
15 Geeralized Itersectio iary itersectio operator: -ary itersectio: 2 (( (( 2 ) ) ) (groupig & order is irrelevat) ig rch otatio: Geerally, itersectio of sets i for i I: i i i I i For ifiite umber of sets: i i ICS 4: Discrete Mathematics I Fall 2 9-5
16 9-6 ICS 4: Discrete Mathematics I Fall 2 },2,3},2} } 3 2 i i Geeralized Itersectio Eamples Let i i, i+, i+2, }. The, Let i, 2, 3,,i } for i, 2, 3,. The, 2,...},, 2,...},, 2,3,4,...},2,3,...} i i
17 it Strig Represetatio of Sets frequet theme of this course are methods of represetig oe discrete structure usig aother discrete structure of a differet type. For a eumerable uiversal set U with orderig, 2, 3,, we ca represet a fiite set S U as the fiite bit strig b b 2 b where b i if i S ad b i if i S. E.g. U N, S 2,3,5,7,},. I this represetatio, the set operators,, are implemeted directly by bitwise OR, ND, NOT! ICS 4: Discrete Mathematics I Fall 2 9-7
18 Eamples of Sets as it Strigs Let U, 2, 3, 4, 5, 6, 7, 8, 9, }, ad the orderig of elemets of U has the elemets i icreasig order, the S, 2, 3, 4, 5} S 2, 3, 5, 7, 9} 2 S S 2, 2, 3, 4, 5, 7, 9} bit strig 2 S S 2, 3, 5} bit strig 2 S 6, 7, 8, 9, } bit strig ICS 4: Discrete Mathematics I Fall 2 9-8
Chapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More informationEE260: Digital Design, Spring n Binary logic and Gates n Boolean Algebra. n Basic Properties n Algebraic Manipulation
EE26: Digital Desig, Sprig 28 2-Ja-8 EE 26: Itroductio to Digital Desig Boolea lgebra: Logic Represetatios ad alysis Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Overview Biary
More informationSets. Sets. Operations on Sets Laws of Algebra of Sets Cardinal Number of a Finite and Infinite Set. Representation of Sets Power Set Venn Diagram
Sets MILESTONE Sets Represetatio of Sets Power Set Ve Diagram Operatios o Sets Laws of lgebra of Sets ardial Number of a Fiite ad Ifiite Set I Mathematical laguage all livig ad o-livig thigs i uiverse
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationLecture 10: Mathematical Preliminaries
Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this
More informationWrap of Number Theory & Midterm Review. Recall: Fundamental Theorem of Arithmetic
Wrap of Number Theory & Midterm Review F Primes, GCD, ad LCM (Sectio 3.5 i text) F Midterm Review Sectios.-.7 Propositioal logic Predicate logic Rules of iferece ad proofs Sectios.-.3 Sets ad Set operatios
More information2.4 Sequences, Sequences of Sets
72 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.4 Sequeces, Sequeces of Sets 2.4.1 Sequeces Defiitio 2.4.1 (sequece Let S R. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For each
More informationLecture Notes for CS 313H, Fall 2011
Lecture Notes for CS 313H, Fall 011 August 5. We start by examiig triagular umbers: T () = 1 + + + ( = 0, 1,,...). Triagular umbers ca be also defied recursively: T (0) = 0, T ( + 1) = T () + + 1, or usig
More informationCS161 Handout 05 Summer 2013 July 10, 2013 Mathematical Terms and Identities
CS161 Hadout 05 Summer 2013 July 10, 2013 Mathematical Terms ad Idetities Thaks to Ady Nguye ad Julie Tibshirai for their advice o this hadout. This hadout covers mathematical otatio ad idetities that
More informationSets and Probabilistic Models
ets ad Probabilistic Models Berli Che Departmet of Computer ciece & Iformatio Egieerig Natioal Taiwa Normal iversity Referece: - D. P. Bertsekas, J. N. Tsitsiklis, Itroductio to Probability, ectios 1.1-1.2
More informationApply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.
Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationLecture 2.5: Sequences
Lecture.5: Sequeces CS 50, Discrete Structures, Fall 015 Nitesh Saxea Adopted from previous lectures by Zeph Gruschlag Course Admi HW posted Covers Chapter Due Oct 0 (Tue) Mid Term 1: Oct 15 (Thursday)
More informationSets are collection of objects that can be displayed in different forms. Two of these forms are called Roster Method and Builder Set Notation.
Sectio 2.1 Set ad Set Operators Defiitio of a set set is a collectio of objects thigs or umbers. Sets are collectio of objects that ca be displayed i differet forms. Two of these forms are called Roster
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
More informationSets and Probabilistic Models
ets ad Probabilistic Models Berli Che Departmet of Computer ciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Referece: - D. P. Bertsekas, J. N. Tsitsiklis, Itroductio to Probability, ectios 1.1-1.2
More informationComputing the output response of LTI Systems.
Computig the output respose of LTI Systems. By breaig or decomposig ad represetig the iput sigal to the LTI system ito terms of a liear combiatio of a set of basic sigals. Usig the superpositio property
More informationSection 4.3. Boolean functions
Sectio 4.3. Boolea fuctios Let us take aother look at the simplest o-trivial Boolea algebra, ({0}), the power-set algebra based o a oe-elemet set, chose here as {0}. This has two elemets, the empty set,
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationIntroduction to Probability. Ariel Yadin. Lecture 2
Itroductio to Probability Ariel Yadi Lecture 2 1. Discrete Probability Spaces Discrete probability spaces are those for which the sample space is coutable. We have already see that i this case we ca take
More informationComputability and computational complexity
Computability ad computatioal complexity Lecture 4: Uiversal Turig machies. Udecidability Io Petre Computer Sciece, Åbo Akademi Uiversity Fall 2015 http://users.abo.fi/ipetre/computability/ 21. toukokuu
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More information1 Introduction. 1.1 Notation and Terminology
1 Itroductio You have already leared some cocepts of calculus such as limit of a sequece, limit, cotiuity, derivative, ad itegral of a fuctio etc. Real Aalysis studies them more rigorously usig a laguage
More information3.1. Introduction Assumptions.
Sectio 3. Proofs 3.1. Itroductio. A roof is a carefully reasoed argumet which establishes that a give statemet is true. Logic is a tool for the aalysis of roofs. Each statemet withi a roof is a assumtio,
More informationAs stated by Laplace, Probability is common sense reduced to calculation.
Note: Hadouts DO NOT replace the book. I most cases, they oly provide a guidelie o topics ad a ituitive feel. The math details will be covered i class, so it is importat to atted class ad also you MUST
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationChapter 1. Probability
Chapter. Probability. Set defiitios 2. Set operatios 3. Probability itroduced through sets ad relative frequecy 4. Joit ad coditioal probability 5. Idepedet evets 6. Combied experimets 7. Beroulli trials
More informationCSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo
Coutig Methods CSE 191, Class Note 05: Coutig Methods Computer Sci & Eg Dept SUNY Buffalo c Xi He (Uiversity at Buffalo CSE 191 Discrete Structures 1 / 48 Need for Coutig The problem of coutig the umber
More informationREVIEW FOR CHAPTER 1
REVIEW FOR CHAPTER 1 A short summary: I this chapter you helped develop some basic coutig priciples. I particular, the uses of ordered pairs (The Product Priciple), fuctios, ad set partitios (The Sum Priciple)
More informationHere are some examples of algebras: F α = A(G). Also, if A, B A(G) then A, B F α. F α = A(G). In other words, A(G)
MATH 529 Probability Axioms Here we shall use the geeral axioms of a probability measure to derive several importat results ivolvig probabilities of uios ad itersectios. Some more advaced results will
More informationStructural Functionality as a Fundamental Property of Boolean Algebra and Base for Its Real-Valued Realizations
Structural Fuctioality as a Fudametal Property of Boolea Algebra ad Base for Its Real-Valued Realizatios Draga G. Radojević Uiversity of Belgrade, Istitute Mihajlo Pupi, Belgrade draga.radojevic@pupi.rs
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More information1 Summary: Binary and Logic
1 Summary: Biary ad Logic Biary Usiged Represetatio : each 1-bit is a power of two, the right-most is for 2 0 : 0110101 2 = 2 5 + 2 4 + 2 2 + 2 0 = 32 + 16 + 4 + 1 = 53 10 Usiged Rage o bits is [0...2
More informationMeasure and Measurable Functions
3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies
More informationMajor Themes. Sets and Logic. Sets and cardinality. Basic terminology. Dr Papalaskari 1. Sets. CSC 1300 Discrete Structures. Villanova University
Major hemes ets ad Logic Villaova iversity ets Ways of defiig sets ubsets, complemets, the uiversal set Ve diagrams et idekkes Cartesia product ParKKos Basic termiology A set is a uordered collecko of
More informationCIS Spring 2018 (instructor Val Tannen)
CIS 160 - Sprig 2018 (istructor Val Tae) Lecture 5 Thursday, Jauary 25 COUNTING We cotiue studyig how to use combiatios ad what are their properties. Example 5.1 How may 8-letter strigs ca be costructed
More informationPROBLEMS ON ABSTRACT ALGEBRA
PROBLEMS ON ABSTRACT ALGEBRA 1 (Putam 197 A). Let S be a set ad let be a biary operatio o S satisfyig the laws x (x y) = y for all x, y i S, (y x) x = y for all x, y i S. Show that is commutative but ot
More informationCS166 Handout 02 Spring 2018 April 3, 2018 Mathematical Terms and Identities
CS166 Hadout 02 Sprig 2018 April 3, 2018 Mathematical Terms ad Idetities Thaks to Ady Nguye ad Julie Tibshirai for their advice o this hadout. This hadout covers mathematical otatio ad idetities that may
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationIntroduction to Probability. Ariel Yadin. Lecture 7
Itroductio to Probability Ariel Yadi Lecture 7 1. Idepedece Revisited 1.1. Some remiders. Let (Ω, F, P) be a probability space. Give a collectio of subsets K F, recall that the σ-algebra geerated by K,
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More informationMachine Learning Theory Tübingen University, WS 2016/2017 Lecture 11
Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract We will itroduce the otio of reproducig kerels ad associated Reproducig Kerel Hilbert Spaces (RKHS). We will cosider couple
More information9.3 Power Series: Taylor & Maclaurin Series
9.3 Power Series: Taylor & Maclauri Series If is a variable, the a ifiite series of the form 0 is called a power series (cetered at 0 ). a a a a a 0 1 0 is a power series cetered at a c a a c a c a c 0
More informationLecture 2: April 3, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,
More informationNumber Representation
Number Represetatio 1 Number System :: The Basics We are accustomed to usig the so-called decimal umber system Te digits :: 0,1,2,3,4,5,6,7,8,9 Every digit positio has a weight which is a power of 10 Base
More informationPb ( a ) = measure of the plausibility of proposition b conditional on the information stated in proposition a. & then using P2
Axioms for Probability Logic Pb ( a ) = measure of the plausibility of propositio b coditioal o the iformatio stated i propositio a For propositios a, b ad c: P: Pb ( a) 0 P2: Pb ( a& b ) = P3: Pb ( a)
More informationName of the Student:
SUBJECT NAME : Discrete Mathematics SUBJECT CODE : MA 65 MATERIAL NAME : Part A questios MATERIAL CODE : JM08AM1013 REGULATION : R008 UPDATED ON : May-Jue 016 (Sca the above Q.R code for the direct dowload
More informationClass notes on sec+ons 4.2, 5.1, 5.2 and 5.3
Class otes o sec+os 4.2, 5.1, 5.2 ad 5.3 Topics covered: Recursive defii1o Rudimetary discussio o rela1os Fuc1os: ijec1ve, surjec1ve ad bijec1ve Recursive Defii+os Recursively defied sequece Cosider the
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More information11.1 Arithmetic Sequences and Series
11.1 Arithmetic Sequeces ad Series A itroductio 1, 4, 7, 10, 13 9, 1, 7, 15 6., 6.6, 7, 7.4 ππ+, 3, π+ 6 Arithmetic Sequeces ADD To get ext term 35 1 7. 3π + 9, 4, 8, 16, 3 9, 3, 1, 1/ 3 1,1/ 4,1/16,1/
More informationDiscrete Math Class 5 ( )
Discrete Math 37110 - Class 5 (2016-10-11 Istructor: László Babai Notes tae by Jacob Burroughs Revised by istructor 5.1 Fermat s little Theorem Theorem 5.1 (Fermat s little Theorem. If p is prime ad gcd(a,
More informationarxiv: v1 [math.co] 23 Mar 2016
The umber of direct-sum decompositios of a fiite vector space arxiv:603.0769v [math.co] 23 Mar 206 David Ellerma Uiversity of Califoria at Riverside August 3, 208 Abstract The theory of q-aalogs develops
More informationLinearAlgebra DMTH502
LiearAlgebra DMTH50 LINEAR ALGEBRA Copyright 0 J D Aad All rights reserved Produced & Prited by EXCEL BOOKS PRIVATE LIMITED A-45, Naraia, Phase-I, New Delhi-008 for Lovely Professioal Uiversity Phagwara
More information7. Modern Techniques. Data Encryption Standard (DES)
7. Moder Techiques. Data Ecryptio Stadard (DES) The objective of this chapter is to illustrate the priciples of moder covetioal ecryptio. For this purpose, we focus o the most widely used covetioal ecryptio
More informationAn Intuitionistic fuzzy count and cardinality of Intuitionistic fuzzy sets
Malaya Joural of Matematik 4(1)(2013) 123 133 A Ituitioistic fuzzy cout ad cardiality of Ituitioistic fuzzy sets B. K. Tripathy a, S. P. Jea b ad S. K. Ghosh c, a School of Computig Scieces ad Egieerig,
More informationCALCULATING FIBONACCI VECTORS
THE GENERALIZED BINET FORMULA FOR CALCULATING FIBONACCI VECTORS Stuart D Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithacaedu ad Dai Novak Departmet
More informationProperties of Regular Languages. Reading: Chapter 4
Properties of Regular Laguages Readig: Chapter 4 Topics ) How to prove whether a give laguage is regular or ot? 2) Closure properties of regular laguages 3) Miimizatio of DFAs 2 Some laguages are ot regular
More informationLecture 4: Grassmannians, Finite and Affine Morphisms
18.725 Algebraic Geometry I Lecture 4 Lecture 4: Grassmaias, Fiite ad Affie Morphisms Remarks o last time 1. Last time, we proved the Noether ormalizatio lemma: If A is a fiitely geerated k-algebra, the,
More informationTutorial F n F n 1
(CS 207) Discrete Structures July 30, 203 Tutorial. Prove the followig properties of Fiboacci umbers usig iductio, where Fiboacci umbers are defied as follows: F 0 =0,F =adf = F + F 2. (a) Prove that P
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationThe Borel-Cantelli Lemma and its Applications
The Borel-Catelli Lemma ad its Applicatios Ala M. Falleur Departmet of Mathematics ad Statistics The Uiversity of New Mexico Albuquerque, New Mexico, USA Dig Li Departmet of Electrical ad Computer Egieerig
More informationAlgorithm of Superposition of Boolean Functions Given with Truth Vectors
IJCSI Iteratioal Joural of Computer Sciece Issues, Vol 9, Issue 4, No, July ISSN (Olie: 694-84 wwwijcsiorg 9 Algorithm of Superpositio of Boolea Fuctios Give with Truth Vectors Aatoly Plotikov, Aleader
More informationEE260: Digital Design, Spring n MUX Gate n Rudimentary functions n Binary Decoders. n Binary Encoders n Priority Encoders
EE260: Digital Desig, Sprig 2018 EE 260: Itroductio to Digital Desig MUXs, Ecoders, Decoders Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Overview of Ecoder ad Decoder MUX Gate
More informationPROBABILITY LOGIC: Part 2
James L Bec 2 July 2005 PROBABILITY LOGIC: Part 2 Axioms for Probability Logic Based o geeral cosideratios, we derived axioms for: Pb ( a ) = measure of the plausibility of propositio b coditioal o the
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationAlgorithm Analysis. Chapter 3
Data Structures Dr Ahmed Rafat Abas Computer Sciece Dept, Faculty of Computer ad Iformatio, Zagazig Uiversity arabas@zu.edu.eg http://www.arsaliem.faculty.zu.edu.eg/ Algorithm Aalysis Chapter 3 3. Itroductio
More informationMathematical Induction
Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a
More informationProbability and Random Processes
Probability ad Radom Processes Lecture 5 Probability ad radom variables The law of large umbers Mikael Skoglud, Probability ad radom processes 1/21 Why Measure Theoretic Probability? Stroger limit theorems
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationChapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:
Chapter 7 COMBINATIONS AND PERMUTATIONS We have see i the previous chapter that (a + b) ca be writte as 0 a % a & b%þ% a & b %þ% b where we have the specific formula for the biomial coefficiets: '!!(&)!
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationMathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1
Mathematical Descriptio of Discrete-Time Sigals 9/10/16 M. J. Roberts - All Rights Reserved 1 Samplig ad Discrete Time Samplig is the acquisitio of the values of a cotiuous-time sigal at discrete poits
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 40 Digital Sigal Processig Prof. Mark Fowler Note Set #3 Covolutio & Impulse Respose Review Readig Assigmet: Sect. 2.3 of Proakis & Maolakis / Covolutio for LTI D-T systems We are tryig to fid y(t)
More informationHomework 9. (n + 1)! = 1 1
. Chapter : Questio 8 If N, the Homewor 9 Proof. We will prove this by usig iductio o. 2! + 2 3! + 3 4! + + +! +!. Base step: Whe the left had side is. Whe the right had side is 2! 2 +! 2 which proves
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationMathCity.org Merging man and maths
MathCityorg Mergig ma ad maths Defiitios: Mathematics HSSC-I Textbook of Algebra ad Trigoometry for Class XI Collected by: Muhammad Waqas Sulaima This documet cotais all the defiitios of Mathematics HSSC-I
More informationHILBERT SPACE GEOMETRY
HILBERT SPACE GEOMETRY Defiitio: A vector space over is a set V (whose elemets are called vectors) together with a biary operatio +:V V V, which is called vector additio, ad a eteral biary operatio : V
More informationii. O = {x x = 2k + 1 for some integer k} (This set could have been listed O = { -3, -1, 1, 3, 5 }.)
Sets 1 Math 3312 Set Theory Sprig 2008 Itroductio Set theory is a brach of mathematics that deals with the properties of welldefied collectios of objects, which may or may ot be of a mathematical ature,
More informationReview of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk
Review of Discrete-time Sigals ELEC 635 Prof. Siripog Potisuk 1 Discrete-time Sigals Discrete-time, cotiuous-valued amplitude (sampled-data sigal) Discrete-time, discrete-valued amplitude (digital sigal)
More informationReview for Test 3 Math 1552, Integral Calculus Sections 8.8,
Review for Test 3 Math 55, Itegral Calculus Sectios 8.8, 0.-0.5. Termiology review: complete the followig statemets. (a) A geometric series has the geeral form k=0 rk.theseriescovergeswhe r is less tha
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More information6.003 Homework #3 Solutions
6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More information, 4 is the second term U 2
Balliteer Istitute 995-00 wwwleavigcertsolutioscom Leavig Cert Higher Maths Sequeces ad Series A sequece is a array of elemets seperated by commas E,,7,0,, The elemets are called the terms of the sequece
More informationWhat is Probability?
Quatificatio of ucertaity. What is Probability? Mathematical model for thigs that occur radomly. Radom ot haphazard, do t kow what will happe o ay oe experimet, but has a log ru order. The cocept of probability
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationSequences I. Chapter Introduction
Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which
More informationMATH 262A LECTURE 1: AN INTRODUCTION TO BOOLEAN CIRCUITS AND FORMULAE
MATH 262A LECTURE 1: AN INTRODUCTION TO BOOLEAN CIRCUITS AND FORMULAE SCRIBE: CHRISTIAN WOODS 1. Admiistrivia MATH 262A - Circuit Compleit WF 3:30-5:00, APM B412 Istructor: Dr. Sam Buss, sbuss@math.ucsd.edu
More information10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.
0. Sequeces A sequece is a list of umbers writte i a defiite order: a, a,, a, a is called the first term, a is the secod term, ad i geeral eclusively with ifiite sequeces ad so each term Notatio: the sequece
More informationQuick Review of Probability
Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter & Teachig Material.
More informationQuick Review of Probability
Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter 2 & Teachig
More informationResolution Proofs of Generalized Pigeonhole Principles
Resolutio Proofs of Geeralized Pigeohole Priciples Samuel R. Buss Departmet of Mathematics Uiversity of Califoria, Berkeley Győrgy Turá Departmet of Mathematics, Statistics, ad Computer Sciece Uiversity
More informationIntroduction to Automata Theory. Reading: Chapter 1
Itroductio to Automata Theory Readig: Chapter 1 1 What is Automata Theory? Study of abstract computig devices, or machies Automato = a abstract computig device Note: A device eed ot eve be a physical hardware!
More information1 Lecture 2: Sequence, Series and power series (8/14/2012)
Summer Jump-Start Program for Aalysis, 202 Sog-Yig Li Lecture 2: Sequece, Series ad power series (8/4/202). More o sequeces Example.. Let {x } ad {y } be two bouded sequeces. Show lim sup (x + y ) lim
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More information15.083J/6.859J Integer Optimization. Lecture 3: Methods to enhance formulations
15.083J/6.859J Iteger Optimizatio Lecture 3: Methods to ehace formulatios 1 Outlie Polyhedral review Slide 1 Methods to geerate valid iequalities Methods to geerate facet defiig iequalities Polyhedral
More information