Permutations & Combinations. Dr Patrick Chan. Multiplication / Addition Principle Inclusion-Exclusion Principle Permutation / Combination
|
|
- Roxanne Dorthy Spencer
- 5 years ago
- Views:
Transcription
1 Discrete Mathematic Chapter 3: C outig 3. The Basics of Coutig 3.3 Permutatios & Combiatios 3.5 Geeralized Permutatios & Combiatios 3.6 Geeratig Permutatios & Combiatios Dr Patrick Cha School of Computer Sciece ad Egieerig South Chia Uivers ity of Techology Ageda Basic Coutig Priciples Multiplicatio / Additio Priciple Iclusio-Exclusio Priciple Permutatio / Combiatio Distributig Objects ito Boxes Geeratig Permutatios & Combiatios 2
2 Why Coutig? The brute force attack is the most commo way (time cosumed but effective) i hackig How security of your password? 5 digits at most Each digit either 0-9 a-z or A-Z How may times a hacker eed to try i the worst situatio? 3 Why Coutig? Coutig problems arise throughout mathematics ad computer sciece For example the umber of experimet outcomes the umber of operatios i a algorithm (time complexity) 4
3 Basic Coutig Priciple Multiplicatio / Additio Priciple Iclusio-Exclusio Priciple Permutatio / Combiatio Basic Coutig Priciples Multiplicatio (Product) Rule If a task ca be costructed i t successive steps ad step i ca be doe i i ways where i = t the the umber of differet possible ways is x 2 x...x m 5 6
4 Basic Coutig Priciples Additio (Sum) Rule If a task ca be doe i oe of ways i oe of 2 ways... or i oe of m ways where all sets of j ways are disjoit the the umber of ways is m Basic Coutig Priciples: Multiplicatio/Additio Priciple Example I 999 a virus amed Melissa is created by David L. Smith based o a Microsoft Word macro Melissa seds a "Here is that documet you asked for do't show it to aybody else." to the top 50 people i the address book How may s are set after 4 iteratios? st iteratio: 2 d iteratio: 3 rd iteratio: 4 th iteratio: x 50 = x 50 = x 50 = (By Multiplicatio Rule) (By Additio Rule) 8
5 Basic Coutig Priciples: Multiplicatio/Additio Priciple Example 2 A programmig laguage Begier's Allpurpose Symbolic Istructio Code (BASIC) GW-BASIC (986) i MS-DOS 9 Basic Coutig Priciples: Multiplicatio/Additio Priciple Example 2 I BASIC the requiremets of a variable ame A strig of or 2 alphaumeric characters (a-z or 0-9) Begi with a letter Uppercase ad lowercase letters are ot distiguished Differet from the 5 strigs of two characters that are reserved How may differet variable ames are there i this versio of BASIC? 0
6 Basic A strig Coutig of or 2 Priciples: alphaumeric Multiplicatio/Additio characters (umber & letter) Priciple Begi with a letter Example 2 Uppercase ad lowercase letters are ot distiguished Differet from the 5 strigs of two characters that are reserved Number of variables ames cotaiig character (V ) V = 26 because a oe-character variable ame must be a letter Number of variables ames cotaiig 2 characters (V 2 ) For V 2 by the product rule there are 26 x 36 strigs of legth two that begi with a letter ad ed with a alphaumeric character However five of these are excluded V 2 = 26 x 36 5 = 93 Total umber is V + V 2 = = 957 Basic Coutig Priciples: Iclusio-Exclusio Priciple Suppose that a task ca be doe i A or i B ways But some of the set of A ways to do the task are the same as some of the B ways to do the task overcout A B A B Avoid the overcout A U B = A + B - A B 2
7 Basic Coutig Priciples: Iclusio-Exclusio Priciple Example How may bit strigs of legth 8 either start with a bit or ed with the two bits 00? Start with : 2 7 = 28 ways Ed with 00: 2 6 = 64 ways Some of these strigs are the same The bit strigs of legth eight start with a bit ad ed with the two bits = = 60 3 Basic Coutig Priciples: Iclusio-Exclusio Priciple Example 2 A computer compay receives 35 0 applicatios Suppose that 220 majored i computer sciece 47 majored i busiess 5 majored both i computer sciece ad i busiess How may of these applicats majored either i computer sciece or i busiess? Let A : the set of studets majored i computer sciece A U A 2 A 2 : the set of studets majored i busiess = A + A 2 - A A 2 = = = 34 of the applicats majored either i computer sciece or i busiess 4
8 Basic Coutig Priciples Permutatio A permutatio of a set of distict objects is a ordered arragemet of these objects st 2 d r th th (-) (-r+) =! Geeral Case The orderig of r elemets selected from distict elemets is called r-permutatio! P r = P( r) = ( )( 2)...( r+ ) = ( r)! Basic Coutig Priciples Combiatio The uordered selectio of r elemets from distict elemets is called r-combiatio It is a subset of the set with r elemets C r = C( r) = = r r!(! r)! 5 6
9 Basic Coutig Priciples Combiatio C( r) = C( - r) Algebraic Proof C( r) =! r!( r)! = ( (! r))!( r)! =C( r) 7 Basic Coutig Priciples Combiatio Combiatorial proof Usig coutig argumets to prove that both sides of the idetity cout the same objects but i differet ways Usig combiatorial proof for C( r) = C( - r) Suppose that S is a set with elemets. Every subset A of S with r elemets correspods to a subset of S with - r elemets amely A Cosequetly C( r) = C( - r) C r A = C -r A 8
10 Basic Coutig Priciples Permutatio / Combiatio Proof P 2 = 3 C 2 x 2 P 2 Number of r-permutatios of elemets P( r) =C( r) P( r r) Number of r-combiatios of elemets Number of r-permutatios of r elemets P( r) P( r r) =!/( r!/( r r)! r)! =! r!( r)! Basic Coutig Priciples: Permutatio / Combiatio Example Your class has 0 studets. How may differet ways the committee ca be set up:. A committee of four 2. A committee of four ad 0 C 4 4 C oe perso is to serve as chairperso 3. A committee of four ad two co-chairpersos 4. Two committees: 0 C 4 0 C 4 4 C 2 0 C 4 4 C 2 0 C 3 3 C Oe with four members with two co-chairs Oe with three members ad a sigle chair 9 20
11 Coutig Problems How to apply what you have lear to solve the coutig problems? Multiplicatio / Additio Priciple Iclusio-Exclusio Priciple Permutatio / Combiatio List all the possibilities 2 Coutig Problems May coutig problems ca be treated as the ways objects ca be placed ito boxes Distiguishable (labeled) Boxes Idiguishable (ulabeled) Distiguishable (labeled) Objects Idiguishable (ulabeled) 22
12 Distiguishable Objects Distiguishable Boxes How may ways are there to arrage the 5 studets ito a classroom with 5 seats? Permutatio 5! st 2 d 3 rd 4 th 5 th Distiguishable Objects Distiguishable Boxes How may ways are there to arrage the 5 studets (A B C D & E) ito a classroom with 5 seats ad the studet A ad B sit ext to each other? Two situatios: 23 AB C D E BA C D E 4! 4! 2 x 4! 24
13 Distiguishable Objects Distiguishable Boxes How may ways are there to arrage the 5 studets ito the roud table with 5 seats? A roud table meas each patter couts 5 times 5! / 5 Distiguishable Objects Distiguishable Boxes How may strigs of legth r ca be formed from the Eglish alphabet? letters Each letter ca be used repeatedly 26 r strigs of legth r 26
14 Distiguishable Objects Distiguishable Boxes How may differet strigs ca be made by reorderig the letters of the word SUCCESS SUCCESS cotais 3 Ss 2 Cs U ad E Cosiderig: 3 Ss: 7 positios are available 7 C 3 4 positios leave 2 Cs: 4 positios are available 4 C 2 2 positios leave U: 2 positios are available 2 C positio leave E: positios is available C Cosequetly the umber of differet strigs 7 C 3 x 4 C 2 x 2 C x C = 420 Distiguishable Objects Distiguishable Boxes m How may ways to give a apple a orage a baaa ad a strawberry to Mickey Mouse ad Doald Duck? 27 Mickey 0 = 4 C 0 4 C C + 4 C C C 4 Mickey = 4 C Mickey 2 = 4 C 2 Mickey 3 = 4 C 3 Mickey 4 = 4 C 4 (Doald Duck takes the rest) 28
15 Distiguishable Objects Distiguishable Boxes m How may ways to assig 3 apples ad 2 orages to Mickey Mouse ad Doald Duck? 6 x 2 = 2 Distiguishable Objects Idistiguishable Boxes How may poker hads of 5 cards ca be dealt from a stadard deck of 52 cards? 29 Combiatio = 52 r = 5 52 C 5 A = = = 2 A A
16 Distiguishable Objects Idistiguishable Boxes How may flushes are possible i stadard deck of 52 cards? Flush: A set of five cards of the same suit Four suits 4 Hearts Spades Clubs & Diamods For each suit 3 C 5 = cards are selected from 3 cards Aswer: 4 x 287 = Flush 2 A Not Flush Distiguishable Objects Idistiguishable Boxes How may ways to put 3 apples 2 orages ad baaa to 3 idistiguishable boxes ad each box cotais item?
17 Distiguishable Objects Idistiguishable Boxes m How may ways are there to put four differet employees ito three idistiguishable offices whe each office ca cotai ay umber of employees? Let A B C ad D be the four employees Oe Office 4 employees Two Offices employee 3 employees 2 employees 2 employees Three Offices 2 employees employee employee Distiguishable Objects Idistiguishable Boxes Oe Office 4 employees Two Offices employee 3 employees 2 employees 2 employees Three Offices 2 employees employee employee 4 differet ways m { {ABCD { { { { { { { { { { { { { { { { ABC { ABD { ACD { ACD {A B {A C {A D {A B {A C {A D {C D {B D {B C {D {C {B {A {C D {B D {B C {C {B {B {A {A {A { { { { { { { {D {D {C {B {C {D 33 34
18 Distiguishable Objects Idistiguishable Boxes m How may ways to put 3 apples 2 orages ad baaa to 3 idistiguishable boxes ad each box cotais 2 items? 3 Idistiguishable Objects Distiguishable Boxes How may routes are there from the lower-left corer of 4 x 3 grid to the upper-right corer if the turtle is restricted to travelig oly to right or upward? U R U U R R U Each ay route cotais 7 moves: 4 Upward (U) 3 Right (R) Aswer: 7 C
19 Idistiguishable Objects Distiguishable Boxes How may ways are there to select 5 bills from a cash box cotaiig $ bills $2 bills $5 bills $0 bills $20 bills $50 bills ad $00 bills? Assume: Order of selectig does ot matter Bills of each deomiatio are idistiguishable At least five bills of each type Idistiguishable Objects Distiguishable Boxes Select five bills from $ $2 $5 $0 $20 $50 ad $00 37 Bill Bill Bill Bill * ** * * Bill *** * * = 6 bars (lies betwee 7 boxes) 5 stars (5 bills) Total characters * * * * * C 5 =! / (5!6!) =
20 Idistiguishable Objects Distiguishable Boxes How may solutios does the equatio x + x 2 + x 3 = have where x x 2 ad x 3 are oegative itegers? Selectio of items with x items of type x 2 items of type 2 ad x 3 items of type 3 = 3 r = +3- C = (3x2) / (x2) = 78 x x 2 x 3 Idistiguishable Objects Distiguishable Boxes How may solutios does the equatio x + x 2 + x 3 = have where x x 2 ad x 3 itegers ad x x 2 2 ad x 3 3? 39 Selectio of items with x items of type x 2 items of type 2 ad x 3 items of type 3 At least item of type 2 items of type 2 ad 3 items of type = 6 have already be located Therefore =3 r = 6 = C 5 = (7x6) / (x2) = 2 x x 2 x 3 40
21 Idistiguishable Objects Idistiguishable Boxes How may ways are there to pack 3 copies of the same book ito 5 idetical boxes ad a box ca cotai book? Aswer is = = = Idistiguishable Objects Idistiguishable Boxes m How may ways are there to pack 6 copies of the same book ito 4 idetical boxes where a box ca cotai as may as six books? 4 By listig all the possibilities There are 9 ways 42
22 Geeratig Permutatios & Combiatios Sometimes permutatios or combiatios eed to be geerated but ot just couted How ca we systemically geerate all the combiatios of the elemets of a fiite set? 43 Geeratig Combiatios Recall that the bit strig correspodig to a subset For k th positio: : a k is i the subset 0 : a k is ot i the subset If all the bit strigs of legth ca be listed the by the correspodece betwee subsets ad bit strigs a list of all the subsets is obtaied 44
23 Geera tig Combia tios Next Larger Bit Strig Algorithm: Geeratig the ext bit strig (b - b b b 0 ) where the curret bit strig is ot equal to...). i = 0 2. while b i = 2. b i = i = i + 3. b i = Treat it as a biary umber ad add each time Geeratig Combiatios: Next Larger Bit Strig Example Fid out the ext combiatio usig ext larger bit strig algorithm for Next: i = 0 2. while b i = 3. b i = 2.b i = 0 2.2i = i + 45 b 3 b 2 b b 0 46
24 Geera tig Combia tios Next Larger r-combiatios Algorithm: Geeratig the ext larger r- combiatios after {a a 2 a r by give a set { {a a 2. i = r { while a i = -r+ i 2. i = i - 3. a i = a i + 4. for j = i + to r 4. a j = a i + j -i locate the last a i iea i -r + add to a i From a i+ to a r Assig ew values { 2 { 3 { 4 {2 3 {2 4 {3 4 Geera tig Combia tios Example Fid the ext larger 4-combiatio of the set { after { i = r while a i = -r + i 2. i = i - 3. a i = a i + 4. for j = i + to r 4. a j = a i + j -i a = a 2 = 2 a 3 = 5 ad a 4 = 6 The last a i such that a i -r + is a 2 (i = 2) Next larger 4-combiatio a 2 a 3 a 4 = a 2 + = a 2 + j i = a 2 + j i Hece : { = 2 + = 3 = = 4 = = 5 a 4 = 6 a 3 = 5 a 2 = 2 = =
25 Geera tig Combia tios Example 2 List all 3-combiatio for the set {a b e Assume {a b e = { 2 5 For all {a a 2 a 3. {a b c 2. {a b d 3. {a b e 4. {a c d 5. {a c e 6. {a d e 7. {b c d 8. {b c e 9. {b d e 0. {c d e. i = r 2. while a i = -r + i 2. i = i - 3. a i = a i + 4. for j = i + to r 4. a j = a i + j -i 49 Geeratig Permutatios Ay set ca be placed i oe-to-oe correspodece with the set { The permutatios of ay set of elemets ca be listed by geeratig the permutatios of the smallest positive itegers The algorithms based o the lexicographic (or dictioary) orderig is discussed 50
26 Geeratig Permutatios Algorithm: Geeratig the ext permutatio of (a a 2... a ) i Lexicographic Order by give permutatio is { 2... where (a a 2... a ) is ot equal to ( ). j = 2. while a j > a j+ 2. j := j 3. k = 4. while a j > a k 4. k = k 5. iterchage a j ad a k 6. r = 7. s = j + 8. while r > s 8. iterchage a r ad a s 8.2 r = r ad s = s + j is the largest subscript with a j < a j+ a k is the smallest iteger greater tha a j to the right of a j Sort the umber after the j th positio i icreasig order {a a 2 a 3 { 2 3 { 2 3 { 3 2 {2 3 {2 3 {3 2 {3 2 Geeratig Permutatios Example What is the ext permutatio i lexicographic order after 36254? 5 The last pair of a j ad a j+ where a j < a j+ is a 3 = 2 ad a 4 = 5 The least iteger to the right of 2 that is greater tha 2 isa s = 4 Exchage a j ad a s Hece 4 is placed i the third positio 5 2 are placed i order i the last three positios Hece the ext permutatio is
27 Geeratig Permutatios r-permutatios How ca we list all r-permutatios from a set { ? r-combiatio {a a 2 a 3 { Use ext larger r-combiatios lists all r-combiatios 2. For each r-combiatio use -permutatio to list all permutatios { 2 3 { 2 4 { 3 4 { permutatio { 2 3 { 3 2 {2 3 {2 3 {3 2 {3 2 53
Section 5.1 The Basics of Counting
1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of
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 information3.1 Counting Principles
3.1 Coutig Priciples Goal: Cout the umber of objects i a set. Notatio: Whe S is a set, S deotes the umber of objects i the set. This is also called S s cardiality. Additio Priciple: Whe you wat to cout
More informationInjections, Surjections, and the Pigeonhole Principle
Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs
More informationIntermediate Math Circles November 4, 2009 Counting II
Uiversity of Waterloo Faculty of Mathematics Cetre for Educatio i Mathematics ad Computig Itermediate Math Circles November 4, 009 Coutig II Last time, after lookig at the product rule ad sum rule, we
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
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 informationHomework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is
Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of
More information( ) GENERATING FUNCTIONS
GENERATING FUNCTIONS Solve a ifiite umber of related problems i oe swoop. *Code the problems, maipulate the code, the decode the aswer! Really a algebraic cocept but ca be eteded to aalytic basis for iterestig
More informationPermutations, Combinations, and the Binomial Theorem
Permutatios, ombiatios, ad the Biomial Theorem Sectio Permutatios outig methods are used to determie the umber of members of a specific set as well as outcomes of a evet. There are may differet ways to
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 informationGenerating Functions. 1 Operations on generating functions
Geeratig Fuctios The geeratig fuctio for a sequece a 0, a,..., a,... is defied to be the power series fx a x. 0 We say that a 0, a,... is the sequece geerated by fx ad a is the coefficiet of x. Example
More informationChapter 6. Advanced Counting Techniques
Chapter 6 Advaced Coutig Techiques 6.: Recurrece Relatios Defiitio: A recurrece relatio for the sequece {a } is a equatio expressig a i terms of oe or more of the previous terms of the sequece: a,a2,a3,,a
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 informationSolutions to Final Exam
Solutios to Fial Exam 1. Three married couples are seated together at the couter at Moty s Blue Plate Dier, occupyig six cosecutive seats. How may arragemets are there with o wife sittig ext to her ow
More informationBooks Recommended for Further Reading
Books Recommeded for Further Readig by 8.5..8 o 0//8. For persoal use oly.. K. P. Bogart, Itroductory Combiatorics rd ed., S. I. Harcourt Brace College Publishers, 998.. R. A. Brualdi, Itroductory Combiatorics
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 informationCombinatorics II. Combinatorics. Product Rule. Sum Rule II. Theorem (Product Rule) Theorem (Sum Rule)
Combiatorics Combiatorics I Slides by Christopher M. Bourke Istructor: Berthe Y. Choueiry Fall 27 Computer Sciece & Egieerig 235 to Discrete Mathematics Sectios 5.-5.6 & 7.5-7.6 of Rose cse235@cse.ul.edu
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 informationTopic 5: Basics of Probability
Topic 5: Jue 1, 2011 1 Itroductio Mathematical structures lie Euclidea geometry or algebraic fields are defied by a set of axioms. Mathematical reality is the developed through the itroductio of cocepts
More informationFoundations of Computer Science Lecture 13 Counting
Foudatios of Computer Sciece Lecture 3 Coutig Coutig Sequeces Build-Up Coutig Coutig Oe Set by Coutig Aother: Bijectio Permutatios ad Combiatios Last Time Be careful of what you read i the media: sex i
More informationCombinatorics I Introduction. Combinatorics. Combinatorics I Motivating Example. Combinations. Product Rule. Permutations. Theorem (Product Rule)
Combiatorics I Itroductio Combiatorics Computer Sciece & Egieerig 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.ul.edu Combiatorics is the study of collectios of objects. Specifically, coutig
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 informationARRANGEMENTS IN A CIRCLE
ARRANGEMENTS IN A CIRCLE Whe objects are arraged i a circle, the total umber of arragemets is reduced. The arragemet of (say) four people i a lie is easy ad o problem (if they liste of course!!). With
More informationChapter 1 : Combinatorial Analysis
STAT/MATH 394 A - PROBABILITY I UW Autum Quarter 205 Néhémy Lim Chapter : Combiatorial Aalysis A major brach of combiatorial aalysis called eumerative combiatorics cosists of studyig methods for coutig
More informationWhat is Probability?
Quatificatio of ucertaity. What is Probability? Mathematical model for thigs that occur radomly. Radom ot haphazard, do t ow what will happe o ay oe experimet, but has a log ru order. The cocept of probability
More information(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.
SOLUTIONS Homewor 5 Due /6/19 Exercise. (a Cosider the set {a, b, c}. For each of the followig, (A list the objects described, (B give a formula that tells you how may you should have listed, ad (C verify
More informationEnd-of-Year Contest. ERHS Math Club. May 5, 2009
Ed-of-Year Cotest ERHS Math Club May 5, 009 Problem 1: There are 9 cois. Oe is fake ad weighs a little less tha the others. Fid the fake coi by weighigs. Solutio: Separate the 9 cois ito 3 groups (A, B,
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 informationBasic Counting. Periklis A. Papakonstantinou. York University
Basic Coutig Periklis A. Papakostatiou York Uiversity We survey elemetary coutig priciples ad related combiatorial argumets. This documet serves oly as a remider ad by o ways does it go i depth or is it
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 informationLet us consider the following problem to warm up towards a more general statement.
Lecture 4: Sequeces with repetitios, distributig idetical objects amog distict parties, the biomial theorem, ad some properties of biomial coefficiets Refereces: Relevat parts of chapter 15 of the Math
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 information1 Counting and Stirling Numbers
1 Coutig ad Stirlig Numbers Natural Numbers: We let N {0, 1, 2,...} deote the set of atural umbers. []: For N we let [] {1, 2,..., }. Sym: For a set X we let Sym(X) deote the set of bijectios from X to
More informationCOMP 2804 Solutions Assignment 1
COMP 2804 Solutios Assiget 1 Questio 1: O the first page of your assiget, write your ae ad studet uber Solutio: Nae: Jaes Bod Studet uber: 007 Questio 2: I Tic-Tac-Toe, we are give a 3 3 grid, cosistig
More information18th Bay Area Mathematical Olympiad. Problems and Solutions. February 23, 2016
18th Bay Area Mathematical Olympiad February 3, 016 Problems ad Solutios BAMO-8 ad BAMO-1 are each 5-questio essay-proof exams, for middle- ad high-school studets, respectively. The problems i each exam
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 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 informationCombinatorially Thinking
Combiatorially Thiig SIMUW 2008: July 4 25 Jeifer J Qui jjqui@uwashigtoedu Philosophy We wat to costruct our mathematical uderstadig To this ed, our goal is to situate our problems i cocrete coutig cotexts
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 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 informationPutnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)
Putam Traiig Exercise Coutig, Probability, Pigeohole Pricile (Aswers) November 24th, 2015 1. Fid the umber of iteger o-egative solutios to the followig Diohatie equatio: x 1 + x 2 + x 3 + x 4 + x 5 = 17.
More informationSome Basic Counting Techniques
Some Basic Coutig Techiques Itroductio If A is a oempty subset of a fiite sample space S, the coceptually simplest way to fid the probability of A would be simply to apply the defiitio P (A) = s A p(s);
More informationarxiv: v1 [math.nt] 10 Dec 2014
A DIGITAL BINOMIAL THEOREM HIEU D. NGUYEN arxiv:42.38v [math.nt] 0 Dec 204 Abstract. We preset a triagle of coectios betwee the Sierpisi triagle, the sum-of-digits fuctio, ad the Biomial Theorem via a
More information05 - PERMUTATIONS AND COMBINATIONS Page 1 ( Answers at the end of all questions )
05 - PERMUTATIONS AND COMBINATIONS Page 1 ( Aswers at the ed of all questios ) ( 1 ) If the letters of the word SACHIN are arraged i all possible ways ad these words are writte out as i dictioary, the
More informationdistinct distinct n k n k n! n n k k n 1 if k n, identical identical p j (k) p 0 if k > n n (k)
THE TWELVEFOLD WAY FOLLOWING GIAN-CARLO ROTA How ay ways ca we distribute objects to recipiets? Equivaletly, we wat to euerate equivalece classes of fuctios f : X Y where X = ad Y = The fuctios are subject
More informationCSE 21 Mathematics for
CSE 2 Mathematics for Algorithm ad System Aalysis Summer, 2005 Outlie What a geeratig fuctio is How to create a geeratig fuctio to model a problem Fidig the desired coefficiet Partitios Expoetial geeratig
More informationYou may work in pairs or purely individually for this assignment.
CS 04 Problem Solvig i Computer Sciece OOC Assigmet 6: Recurreces You may work i pairs or purely idividually for this assigmet. Prepare your aswers to the followig questios i a plai ASCII text file or
More informationRecursive Algorithm for Generating Partitions of an Integer. 1 Preliminary
Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the
More informationA Combinatorial Proof of a Theorem of Katsuura
Mathematical Assoc. of America College Mathematics Joural 45:1 Jue 2, 2014 2:34 p.m. TSWLatexiaTemp 000017.tex A Combiatorial Proof of a Theorem of Katsuura Bria K. Miceli Bria Miceli (bmiceli@triity.edu)
More informationM A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O
M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet
More informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More informationDisjoint set (Union-Find)
CS124 Lecture 7 Fall 2018 Disjoit set (Uio-Fid) For Kruskal s algorithm for the miimum spaig tree problem, we foud that we eeded a data structure for maitaiig a collectio of disjoit sets. That is, we eed
More informationAddition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c
Notes for March 31 Fields: A field is a set of umbers with two (biary) operatios (usually called additio [+] ad multiplicatio [ ]) such that the followig properties hold: Additio: Name Descriptio Commutativity
More informationPERMUTATIONS AND COMBINATIONS
5. PERMUTATIONS AND COMBINATIONS 1. INTRODUCTION The mai subject of this chapter is coutig. Give a set of objects the problem is to arrage some or all of them accordig to some order or to select some or
More information# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf.
Combiatorics Graph Theory Coutig labelled ad ulabelled graphs There are 2 ( 2) labelled graphs of order. The ulabelled graphs of order correspod to orbits of the actio of S o the set of labelled graphs.
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 informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More informationSTUDY PACKAGE. Subject : Mathematics Topic : Permutation and Combination Available Online :
fo/u fopkjr Hkh# tu] ugha vkjehks dke] foifr s[k NksM+s rqjar e/;e eu dj ';kea iq#"k flag ladyi dj] lgrs foifr vusd] ^cuk^ u NksM+s /;s; dks] j?kqcj jk[ks VsdAA jfpr% ekuo /kez iz.ksrk l~xq# Jh j.knksm+klth
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
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 information1 What is combinatorics?
1 What is combiatorics Combiatorics is the brach of mathematics dealig with thigs that are discrete, such as the itegers, or words created from a alphabet. This is i cotrast to aalysis, which deals with
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 informationChapter 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 information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationThe Pigeonhole Principle 3.4 Binomial Coefficients
Discete M athematic Chapte 3: Coutig 3. The Pigeohole Piciple 3.4 Biomial Coefficiets D Patic Cha School of Compute Sciece ad Egieeig South Chia Uivesity of Techology Ageda Ch 3. The Pigeohole Piciple
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 informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the
More informationUNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007
UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST First Roud For all Colorado Studets Grades 7- November, 7 The positive itegers are,,, 4, 5, 6, 7, 8, 9,,,,. The Pythagorea Theorem says that a + b =
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 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 informationLinear Programming and the Simplex Method
Liear Programmig ad the Simplex ethod Abstract This article is a itroductio to Liear Programmig ad usig Simplex method for solvig LP problems i primal form. What is Liear Programmig? Liear Programmig is
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 informationMath 172 Spring 2010 Haiman Notes on ordinary generating functions
Math 72 Sprig 200 Haima Notes o ordiary geeratig fuctios How do we cout with geeratig fuctios? May eumeratio problems which are ot so easy to hadle by elemetary meas ca be solved usig geeratig fuctios
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
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 informationInternational Contest-Game MATH KANGAROO Canada, Grade 11 and 12
Part A: Each correct aswer is worth 3 poits. Iteratioal Cotest-Game MATH KANGAROO Caada, 007 Grade ad. Mike is buildig a race track. He wats the cars to start the race i the order preseted o the left,
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
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 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 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 information(k) x n. n! tk = x a. (i) x p p! ti ) ( q 0. i 0. k A (i) n p
Math 880 Bigraded Classes & Stirlig Cycle Numbers Fall 206 Bigraded classes. Followig Flajolet-Sedgewic Ch. III, we defie a bigraded class A to be a set of combiatorial objects a A with two measures of
More information2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.
CHAPTER 2 The Real Numbers 2.. The Algebraic ad Order Properties of R Defiitio. A biary operatio o a set F is a fuctio B : F F! F. For the biary operatios of + ad, we replace B(a, b) by a + b ad a b, respectively.
More informationMathematical Notation Math Finite Mathematics
Mathematical Notatio Math 60 - Fiite Mathematics Use Word or WordPerfect to recreate the followig documets. Each article is worth 0 poits ad should be emailed to the istructor at james@richlad.edu. If
More information1 Hash tables. 1.1 Implementation
Lecture 8 Hash Tables, Uiversal Hash Fuctios, Balls ad Bis Scribes: Luke Johsto, Moses Charikar, G. Valiat Date: Oct 18, 2017 Adapted From Virgiia Williams lecture otes 1 Hash tables A hash table is a
More informationAlgebraic Geometry I
6.859/15.083 Iteger Programmig ad Combiatorial Optimizatio Fall 2009 Lecture 14: Algebraic Geometry I Today... 0/1-iteger programmig ad systems of polyomial equatios The divisio algorithm for polyomials
More informationCounting Well-Formed Parenthesizations Easily
Coutig Well-Formed Parethesizatios Easily Pekka Kilpeläie Uiversity of Easter Filad School of Computig, Kuopio August 20, 2014 Abstract It is well kow that there is a oe-to-oe correspodece betwee ordered
More informationHOMEWORK 2 SOLUTIONS
HOMEWORK SOLUTIONS CSE 55 RANDOMIZED AND APPROXIMATION ALGORITHMS 1. Questio 1. a) The larger the value of k is, the smaller the expected umber of days util we get all the coupos we eed. I fact if = k
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationProbability and statistics: basic terms
Probability ad statistics: basic terms M. Veeraraghava August 203 A radom variable is a rule that assigs a umerical value to each possible outcome of a experimet. Outcomes of a experimet form the sample
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 information1. n! = n. tion. For example, (n+1)! working with factorials. = (n+1) n (n 1) 2 1
Biomial Coefficiets ad Permutatios Mii-lecture The followig pages discuss a few special iteger coutig fuctios You may have see some of these before i a basic probability class or elsewhere, but perhaps
More informationStat 198 for 134 Instructor: Mike Leong
Chapter 2: Repeated Trials ad Samplig Sectio 2.1 Biomial Distributio 2.2 Normal Approximatio: Method 2.3 Normal Approximatios: Derivatio (Skip) 2.4 Poisso Approximatio 2.5 Radom Samplig Chapter 2 Table
More informationLecture 23 Rearrangement Inequality
Lecture 23 Rearragemet Iequality Holde Lee 6/4/ The Iequalities We start with a example Suppose there are four boxes cotaiig $0, $20, $50 ad $00 bills, respectively You may take 2 bills from oe box, 3
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 informationNUMERICAL METHODS FOR SOLVING EQUATIONS
Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationMT5821 Advanced Combinatorics
MT5821 Advaced Combiatorics 9 Set partitios ad permutatios It could be said that the mai objects of iterest i combiatorics are subsets, partitios ad permutatios of a fiite set. We have spet some time coutig
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 informationSolutions. tan 2 θ(tan 2 θ + 1) = cot6 θ,
Solutios 99. Let A ad B be two poits o a parabola with vertex V such that V A is perpedicular to V B ad θ is the agle betwee the chord V A ad the axis of the parabola. Prove that V A V B cot3 θ. Commet.
More information