Section 5.1 The Basics of Counting
|
|
- Gwenda Williams
- 6 years ago
- Views:
Transcription
1 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 applicatios, e.g. how may differet North America telephoe umbers are possible? How may ways are there to select five players from a 10-member teis team to make a trip to a match at aother school? The Product Rule Suppose that a procedure ca be broke dow ito a sequece of two tasks. If there are 1 ways to do the first task ad for each of these ways of doig the first task, there are 2 ways to do the secod task, the there are 1 2 ways to do the procedure. Example 1 The chairs of a auditorium are to be labeled with a letter followed by a positive umber ot exceedig 100. What is the largest umber of chairs that ca be labeled differetly? The product rule exteds to the case a procedure ca be broke dow ito a sequece of more tha just two tasks. Suppose that the procedure is carried out by performig the tasks T 1, T 2,, T k i sequece. If each task T i ca be doe i i ways, regardless of how the previous tasks were doe, the there are 1 2 k ways to carry out the procedure. Example 2 How may differet licese plates are available if each plate cotais a sequece of three letters followed by three digits? Example 3 Let A = {1, 2,, m} ad B = {1, 2,, }. 1. How may fuctios are there from A to B? 2. How may oe-to-oe fuctios are there from A to B? Example 4 The telephoe umbers i North America must cosist of 10 digits, which are split ito a three-digit area code, three-digit office code, ad four-digit statio code. Accordig to the regulatios of the North America Numberig Pla, each umber should be of the form NXX NXX XXXX, where N deotes a digit that ca take ay of the values 2 through 9, ad X deotes a digit that ca take ay of the values 0 through 9. How may differet North America telephoe umbers are possible?
2 2 We ow itroduce the sum rule. The Sum Rule If a task ca be doe either i oe of 1 ways or i oe of 2 ways, where oe of the set of 1 ways is the same as ay of the set of 2 ways, the there are ways to do the task. Example 5 A studet ca choose a computer project from oe of three lists. The three lists cotai 23, 15, ad 19 possible projects, respectively. No project is o more tha oe list. How may possible projects are there to choose from? May coutig problems caot be solved usig just the product rule or just the sum rule. However, may complicated coutig problems ca be solved usig both of these rules i combiatio. Example 6 Each user o a computer system has a password, which is six to eight characters log, where each character is a uppercase letter or a digit. Each password must cotai at least oe digit. How may possible passwords are there?
3 3 Sectio 5.2 The Pigeohole Priciple Suppose that a flock of 20 pigeos flies ito a set of 19 pigeoholes, the we ca say for sure that at least oe of these 19 pigeoholes must have at least two pigeos i it. This illustrates a geeral priciple called Pigeohole Priciple. Pigeohole Priciple Let k be a positive iteger. If k + 1 or more objects are placed ito k boxes, the there is at least oe box cotaiig two or more of objects. Example 1 A fuctio f from a set with k + 1 or more elemets to a set with k elemets is ot oe-to-oe. Example 2 I ay group of 27 Eglish words, there must be at least two that begi with the same letter. Example 3 Assume that there were more tha 100, 000, 000 wage earers i the Uited States who eared less tha 1, 000, 000 dollars. Show that there are two who eared exactly the same amout of moey, to the pey, last year. Example 4 Let d be a positive iteger. Show that amog ay group of d + 1 (ot ecessarily cosecutive) itegers there are two with exactly the same remaider whe they are divided by d. Example 5 Show that for every iteger there is a multiple of that has oly 0s ad 1s i its decimal expasio.
4 4 Now we wat to geeralize Pigeohole Priciple. Suppose 21 objects are distributed ito 10 boxes, the at least oe box must have at least 3 objects. This is a special case of the followig theorem: The Geeralized Pigeohole Priciple If N objects are placed ito k boxes, the there is at least oe box cotaiig at least N k objects. Proof We use the proof by cotradictio. Suppose ot, that is, each box cotais at most objects i it. The the total umber of objects is at most. Note that N < N + 1, hece k k we have ( ) (( ) ) N N k 1 < k k k = N, which gives a cotradictio. Example 6 Amog 100 people there are at least 100 = 9 who were bor i the same moth. 12 Example 7 There are 38 differet time periods durig which classes at a college ca be scheduled. If there are 677 differet classes, how may differet rooms will be eeded?
5 5 Sectio 5.3 Permutatios ad Combiatios May coutig problems ca be solved by fidig the umber of ways to arrage a specified umber of distict elemets of a set of a particular size, where the order of these elemets matters. We begi by cosiderig a example. Example 1 I how may ways ca we select three studets from a group of five studets to stad i lie for a picture? I how may ways ca we arrage all five of these studets i a lie for a picture? Defiitio A permutatio of a set of distict objects is a ordered arragemet of these objects. A ordered arragemet of r elemets of a set is called a r-permutatio. Example 2 Let S = {1, 2, 3, 4, 5}. The ordered arragemet (4, 2, 1, 5, 3) is a permutatio of S. (3, 1, 4) is a 3-permutatio of S. Defiitio The umber of r-permutatios of a set with elemets is deoted by P (, r) or P r. We wat to compute P (, r). Example 3 Compute P (5, 2) ad P (5, 3). What is P (5, 5)? I geeral, we get I particular, P (, r) = ( 1) ( 2) ( r + 1) = }{{} r factors P (, ) = ( 1) ( 2) 2 1 =!.! ( r)!. Example 4 How may ways are there to select a first-prize wier, a secod-prize wier, ad a third-prize wier from 100 differet people who have etered a cotest? Example 5 How may permutatios of the letters ABCDEF G cotai the strig ABC?
6 6 We ow tur our attetio to coutig uordered selectio of objects. Example 6 How may differet committees of two studets ca be formed from a group of four studets? Example 7 I how may ways ca we choose a chair ad a vice chair from a group of four studets? How is this example differet from the previous oe? Defiitio A r-combiatio of elemets of a set is a uordered selectio of r elemets from the set. Example 8 Let S = {1, 2, 3, 4, 5}. The {1, 3, 4} is a 3-combiatio of S. Defiitio The umber of r-combiatios of a set with elemets is deoted by C(, r), C r, or ( r). Example 9 From Example 6, we see that ( 4 2) =. Example 10 Compute ( 5 2). Compute ( 5 3). I geeral, we have the followig theorem. Theorem The umber of r-combiatios of a set with elemets, where is a oegative iteger ad r is a iteger with 0 r, equals ( )! = r r!( r)!. Sketch of Proof We explai with ( 5 3). Let S = {1, 2, 3, 4, 5} ad cosider all 3-permutatios of S cosistig of {1, 2, 4}. They are: (1, 2, 4), (1, 4, 2), (2, 1, 4), (2, 4, 1), (4, 1, 2), ad (4, 2, 1).
7 7 O the other had, there is oly oe 3-combiatio of S cosistig of {1, 2, 4}; just {1, 2, 4}. Hece there are 6 times as may permutatios as combiatios cosistig of {1, 2, 4}. Here 6 comes from the total umber of differet permutatios of {1, 2, 4}, that is, 6 = 3!. Sice this is true for all 3-combiatios of S, we coclude that ( ) 5 P (5, 3) = 3!. 3 I other words, ( ) 5 = 1 3 3! P (5, 3) = 1 3! 5! (5 2)! = 5! 3!(5 2)!. Example 11 Compute ( 0), ( 1), ad ( ). Example 12 Prove that ( ) ( r = r). Example 13 How may ways are there to select five players from a 10-member teis team to make a trip to a match at aother school? Example 14 Suppose that there are 9 faculty members i the mathematics departmet ad 11 i the computer sciece departmet i a college. How may ways are there to select a committee to develop a discrete mathematics course at the school if the committee is to cosist of three faculty members from the mathematics departmet ad four from the computer sciece departmet?
8 8 Sectio 5.4 Biomial Coefficiets I this sectio we will see examples i which the umbers ( r) play a cetral role. Whe (x + y) 5 = (x + y)(x + y)(x + y)(x + y)(x + y) is expaded, all products of a term i the first sum, a term i the secod sum,..., a term i the fifth sum are added ad terms of the form x 5, x 4 y, x 3 y 2, x 2 y 3, xy 4, ad y 5 arise. To obtai a term of the form x 5, x must be chose from each of five sums ad this ca be doe i oly oe way ad this meas that the coefficiet of x 5 whe (x + y) 5 is multiplied out is 1. To obtai a term of the form x 3 y 2, x must be chose from three of the five sums (ad cosequetly y must be chose from the remaiig two sums). Sice this ca be doe i ( ) 5 3 ways, the coefficiet of x 3 y 2 whe (x + y) 5 is expaded will be ( 5 3). I geeral, we have the followig theorem. The Biomial Theorem Let x ad y be variables, ad let be a oegative iteger. The (x + y) = = ( k k=0 ( 0 ) x + Example 1 Expad (x + y) 5. ) x k y k ( ) x 1 y + 1 ( ) ( ) x 2 y xy ( ) y. Example 2 Fid the coefficiet of x 12 y 13 i the expasio of 1. (x + y) (2x 3y) 25 Example 3 Determie whether we have a term of the form x 14 i the expasio of ( x x) 10. If we do, what is the coefficiet?
9 9 Example 4 Let be a oegative iteger. Compute ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) 3. + ( 1) + ( 2) ( ) ( ) Defiitio A combiatorial proof (or combiatorial argumet) of a idetity is a proof that uses coutig to prove that both sides of the idetity cout the same object but i differet ways. Example 5 Prove the idetities i Example 4 above usig a combiatorial argumet.
10 10 Pascal s Idetity Let ad k be positive itegers with k. The ( ) ( ) ( ) + 1 = +. k k 1 k Proof Vadermode s Idetity Let m,, ad r be oegative itegers with r ot exceedig either m or. The ( ) m + r ( )( ) m =. r r k k Proof k=0 Example 6 Show that ( 2 ) = k=0 ( k) 2.
11 11 The rest of the sectio is devoted to examples where the biomial coefficiets arise. We begi with a defiitio. Defiitio A bit strig (or biary strig) is a strig that cosists of 0 or 1. A k-ary strig is a strig that cosists of 0, 1, 2,, k 1. Example 7 For example, is a bit strig of legth ie. Example 8 How may bit strigs of legth are there? How may k-ary strigs of legth are there? How may bit strigs of legth have exactly r 1 s? Example 9 Let ad r be oegative itegers with r. Show combiatorially that ( ) + 1 = r + 1 j=r ( ) j r by coutig the umber of bit strigs of legth + 1 cotaiig r s. Example 10 How may differet strigs ca be made by reorderig the letters of 1. {A, A, B, B, B}? 2. {S, U, C, C, E, S, S}? 3. {D, O, R, M, I, T, O, R, Y }?
12 12 Example 11 How may shortest paths from A to B are there i the followig? B A Example 12 How may shortest paths from A to B pass through M i the followig? B M A Example 13 How may shortest paths from A to B are there i the followig? (slides) B A
13 13 Example 14 How may shortest paths from A to B do ot pass above the diagoal i the followig? (slides) B A Example 15 There are 2 people i lie to get ito a theater. Admissio is $5. Of the 2 people, have a $5 bill ad have a $10 bill. The box office rather foolishly begis with a empty cash register. I how may ways ca the people lie up so wheever a perso with a $10 bill buys a ticket, the box office has a $5 bill i order to give chage? Example 16 How may o-decreasig fuctios f : {1, 2, 3, 4, 5} {1, 2, 3, 4, 5} such that f(i) i for all i, 1 i 5, are there?
14 14 Example 17 How may oegative iteger solutios are there to the equatio x + y + z = 8? Example 18 How may positive iteger solutios are there to the equatio x + y + z = 8? Example 19 How may strictly icreasig fuctios are there from A = {1, 2, 3, 4} to B = {1, 2, 3, 4, 5, 6, 7}? Example 20 How may o-decreasig fuctios are there from A = {1, 2, 3, 4} to B = {1, 2, 3, 4, 5, 6, 7}?
CSE 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 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 informationPermutations & Combinations. Dr Patrick Chan. Multiplication / Addition Principle Inclusion-Exclusion Principle Permutation / Combination
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
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 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 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 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 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 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 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 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 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 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 informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
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 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 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 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 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 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 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 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 informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationP1 Chapter 8 :: Binomial Expansion
P Chapter 8 :: Biomial Expasio jfrost@tiffi.kigsto.sch.uk www.drfrostmaths.com @DrFrostMaths Last modified: 6 th August 7 Use of DrFrostMaths for practice Register for free at: www.drfrostmaths.com/homework
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
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 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 informationThe Binomial Theorem
The Biomial Theorem Robert Marti Itroductio The Biomial Theorem is used to expad biomials, that is, brackets cosistig of two distict terms The formula for the Biomial Theorem is as follows: (a + b ( k
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 information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More informationMT5821 Advanced Combinatorics
MT5821 Advaced Combiatorics 1 Coutig subsets I this sectio, we cout the subsets of a -elemet set. The coutig umbers are the biomial coefficiets, familiar objects but there are some ew thigs to say about
More informationCh 3.4 Binomial Coefficients. Pascal's Identit y and Triangle. Chapter 3.2 & 3.4. South China University of Technology
Disc ete Mathem atic 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 Pigeohole Piciple Suppose that a
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 informationIs mathematics discovered or
996 Chapter 1 Sequeces, Iductio, ad Probability Sectio 1. Objectives Evaluate a biomial coefficiet. Expad a biomial raised to a power. Fid a particular term i a biomial expasio. The Biomial Theorem Galaxies
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 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 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 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 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 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 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 informationProblem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient
Problem 4: Evaluate by egatig actually u-egatig its upper idex We ow that Biomial coefficiet r { where r is a real umber, is a iteger The above defiitio ca be recast i terms of factorials i the commo case
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 informationSOLUTIONS TO PRISM PROBLEMS Junior Level 2014
SOLUTIONS TO PRISM PROBLEMS Juior Level 04. (B) Sice 50% of 50 is 50 5 ad 50% of 40 is the secod by 5 0 5. 40 0, the first exceeds. (A) Oe way of comparig the magitudes of the umbers,,, 5 ad 0.7 is 4 5
More informationProperties and Tests of Zeros of Polynomial Functions
Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by
More informationBasic Combinatorics. Math 40210, Section 01 Spring Homework 7 due Monday, March 26
Basic Combiatorics Math 40210, Sectio 01 Sprig 2012 Homewor 7 due Moday, March 26 Geeral iformatio: I ecourage you to tal with your colleagues about homewor problems, but your fial write-up must be your
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 informationCombinatorics and Newton s theorem
INTRODUCTION TO MATHEMATICAL REASONING Key Ideas Worksheet 5 Combiatorics ad Newto s theorem This week we are goig to explore Newto s biomial expasio theorem. This is a very useful tool i aalysis, but
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 information3sin A 1 2sin B. 3π x is a solution. 1. If A and B are acute positive angles satisfying the equation 3sin A 2sin B 1 and 3sin 2A 2sin 2B 0, then A 2B
1. If A ad B are acute positive agles satisfyig the equatio 3si A si B 1 ad 3si A si B 0, the A B (a) (b) (c) (d) 6. 3 si A + si B = 1 3si A 1 si B 3 si A = cosb Also 3 si A si B = 0 si B = 3 si A Now,
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 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 informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationand each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.
MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,
More informationSEQUENCES AND SERIES
Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationCS 336. of n 1 objects with order unimportant but repetition allowed.
CS 336. The importat issue is the logic you used to arrive at your aswer.. Use extra paper to determie your solutios the eatly trascribe them oto these sheets. 3. Do ot submit the scratch sheets. However,
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 information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
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 information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
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 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 informationMATH 304: MIDTERM EXAM SOLUTIONS
MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest
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 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 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 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 informationINFINITE SEQUENCES AND SERIES
INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is
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 informationUSA Mathematical Talent Search Round 3 Solutions Year 27 Academic Year
/3/27. Fill i each space of the grid with either a or a so that all sixtee strigs of four cosecutive umbers across ad dow are distict. You do ot eed to prove that your aswer is the oly oe possible; you
More informationIn algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:
74 The Method of Partial Fractios I algebra oe speds much time fidig commo deomiators ad thus simplifyig ratioal epressios For eample: + + + 6 5 + = + = = + + + + + ( )( ) 5 It may the seem odd to be watig
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
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 informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationSection 7 Fundamentals of Sequences and Series
ectio Fudametals of equeces ad eries. Defiitio ad examples of sequeces A sequece ca be thought of as a ifiite list of umbers. 0, -, -0, -, -0...,,,,,,. (iii),,,,... Defiitio: A sequece is a fuctio which
More informationAn analog of the arithmetic triangle obtained by replacing the products by the least common multiples
arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
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 informationInternational Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL Christos Nikolaidis TOPIC NUMBER THEORY
Iteratioal Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL TOPIC NUMBER THEORY METHODS OF PROOF. Couterexample - Cotradictio - Pigeohole Priciple Strog mathematical iductio 2 DIVISIBILITY....
More informationSummer High School 2009 Aaron Bertram
Summer High School 009 Aaro Bertram 3 Iductio ad Related Stuff Let s thik for a bit about the followig two familiar equatios: Triagle Number Equatio Square Number Equatio: + + 3 + + = ( + + 3 + 5 + + (
More informationChapter 8: Estimating with Confidence
Chapter 8: Estimatig with Cofidece Sectio 8.2 The Practice of Statistics, 4 th editio For AP* STARNES, YATES, MOORE Chapter 8 Estimatig with Cofidece 8.1 Cofidece Itervals: The Basics 8.2 8.3 Estimatig
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 informationMath 4707 Spring 2018 (Darij Grinberg): homework set 4 page 1
Math 4707 Sprig 2018 Darij Griberg): homewor set 4 page 1 Math 4707 Sprig 2018 Darij Griberg): homewor set 4 due date: Wedesday 11 April 2018 at the begiig of class, or before that by email or moodle Please
More informationIntroduction To Discrete Mathematics
Itroductio To Discrete Mathematics Review If you put + pigeos i pigeoholes the at least oe hole would have more tha oe pigeo. If (r + objects are put ito boxes, the at least oe of the boxes cotais r or
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 informationSOLVED EXAMPLES
Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as
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 informationRandom Models. Tusheng Zhang. February 14, 2013
Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the
More informationWORKING WITH NUMBERS
1 WORKING WITH NUMBERS WHAT YOU NEED TO KNOW The defiitio of the differet umber sets: is the set of atural umbers {0, 1,, 3, }. is the set of itegers {, 3,, 1, 0, 1,, 3, }; + is the set of positive itegers;
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 informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationAlternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.
0_0905.qxd //0 :7 PM Page SECTION 9.5 Alteratig Series Sectio 9.5 Alteratig Series Use the Alteratig Series Test to determie whether a ifiite series coverges. Use the Alteratig Series Remaider to approximate
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 informationInduction: Solutions
Writig Proofs Misha Lavrov Iductio: Solutios Wester PA ARML Practice March 6, 206. Prove that a 2 2 chessboard with ay oe square removed ca always be covered by shaped tiles. Solutio : We iduct o. For
More informationPairs of disjoint q-element subsets far from each other
Pairs of disjoit q-elemet subsets far from each other Hikoe Eomoto Departmet of Mathematics, Keio Uiversity 3-14-1 Hiyoshi, Kohoku-Ku, Yokohama, 223 Japa, eomoto@math.keio.ac.jp Gyula O.H. Katoa Alfréd
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 information