Let us consider the following problem to warm up towards a more general statement.
|
|
- Moses Chapman
- 5 years ago
- Views:
Transcription
1 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 for CS boo Discrete Structures II Summer 2018 Rutgers Uiversity Istructor: Abhishe Bhrushudi 1 Sequeces with repetitios revisted Let us cosider the followig problem to warm up towards a more geeral statemet Questio How may sequeces are there of the form A, B, C, where A, B ad C are disjoit subsets of S = {1,, 1000}, ad A = 500, B = 325, C = 175? Proof Note that A + B + C = S, ad thus they form a partitio of S To distribute the 1000 elemets of S betwee A, B, ad C, it suffices to specify which elemets of S are chose to go ito A, ad which of them are chose to go to B the rest will the go to C Let s first pic which elemets will go ito A We have to choose 500 elemets from S, so there are ways of doig that Havig piced elemets for A, we would be left with = 500 elemets i S, ad have to choose 325 out of them for B For this, there are ways, ad so the total is: = 1000! !500! 500! 325!175! = 1000! 500!325!175! Let us try to geeralize this to the followig: how may sequeces are there of the form A 1,, A where A 1,, A are disjoit subsets of S = {1,, } ad A 1 = r 1, A 2 = r 2,, A = r with r 1 + r r =? Let us do exactly as we did above: first pic r 1 elemets to put ito A 1, the r 2 to put ito A 2,, ad fially r 1 elemets i A 1 As soo as have filled up the first 1 elemets, we will be left with r r = r elemets, ad thus all of them must go ito A Followig the above calculatios, we see that the umber of ways of picig elemets for A 1,, A 1 is r1 r 1 This ca be writte as r 2 r1 r 2 r 3 r1 r 2 r 1! r 1! r 1 r 2! r 1! r 1! r 2! r 1 r 2! r 3! r 1 r 2 r 3! r 1 r 2! r 1! r 1 r 1! 1
2 If you stare at this expressio for a while you realize that all the umerators except! will get cacelled by some of the deomiators, ad the oly deomiators left will be r 1!r 2! r! where! did the r! eve come from? Thus, the expressio becomes: r 1!r 2!r! Thus, we have Lemma 1 The umber of sequeces of the form A 1,, A where A 1,, A are disjoit subsets! of S = {1,, } ad A 1 = r 1, A 2 = r 2,, A = r with r 1 + r r = is r 1!r 2!r! I other words, the umber of ways of distributig distict objects amog distict parties such! that party i gets exactly r i may objects ad r r = is r 1!r! This also turs out to be the umber of permutatios whe there are some repeated objects as we shall see ow the formula does loo lie the oe we saw i the last lecture, does t it? Suppose we have objects i total, r 1 of type 1, r 2 of type 2,, r of type, such that r 1 + +r = How may distict permutatios are there of these objects? If they were all distict, the the aswer would have bee!, but as we have see before, this will lead to a overcout whe we have repetitios I the last lecture, we suggested that oe ca use the divisio rule to get aroud this problem, ad arrive at the umber of distict permutatios beig! = r 1,, r r 1! r!, where the expressio i the LHS is ow as a multiomial coefficietwe will ow give a alterate ad much cleaer proof of this based o what we just did above with sequece of sets Let s thi of comig up with oe possible arragemet of these objects What eeds to be specified i order to completely specify a arragemet? Well, I eed to first tell you what positios the objects of type 1 go ito, the I eed to tell you what positios the objects of type 2 go ito,, ad fially what positios objects of type 1 go ito As soo as I tell you all that, you ll automatically ow where the objects of type go ito they are forced to go to the remaiig positios Now, how may ways are there to choose the positios for the objects of type 1 There are r 1 objects of type 1, so we eed to choose r 1 out of possible positios, ad thus the umber of ways is r 1 Havig chose the positios for the first type, we the choose positios for the objects of the secod type Now we eed to choose r 2 positios from r 1 available oes, so that s r 1 r 2 waysbut, hold o? Is t this turig out to be exactly what we did above? Turs out you ca do a simple tric thi bijectio method: if you let A i to be all the positios i the permutatio where the r i objects of type i will go ito, the the problem becomes oe of coutig the umber of sequeces of the form A 1,, A, with A 1,, A beig disjoit subsets of {1,, } these are the possible positios i the permutatio of sizes r 1,, r respectively, ad i=1 r i = Now we ca use Lemma 1 to fiish the job, ad coclude that the umber of! distict permutatios is r 1!r! 2 Distributig idetical objects amog distict parties May coutig problems ca be rephrased as the followig problem: Questio Suppose that there are idetical cadies that eed to be distributed amog r childre 2
3 obviously, o two childre are idetical, ad so we have r distict parties here I how may ways ca you do this if you are ot allowed to brea cadies ito smaller pieces? To solve these problems, it s coveiet to covert them ito a liear equatio with costraits thi bijectio method to be able to thi clearly: Let x 1,, x r be r variables such that x i deotes the umber of cadies child i receives Sice all cadies must get distributed, we have that x 1 + x x r = Furthermore, sice you ca t brea the cadies ad must give whole cadies to the childre, we must eforce that the values tae by x 1,, x r be iteger, ie we are iterested i iteger valued solutios to the above equatio Also, it does t mae sese if a variable becomes egative what would that eve mea? istead of givig cadies to the child, as the child for cadies?, so we will say that x 1,, x r 0 So the umber of ways of distributig cadies amog childre become the same as the umber of iteger solutios to the above equatio with the additioal costrait that x 1,, x r 0 While this way of phrasig the problem as fidig solutios to a liear equatio help us thi clearly ad mae sure we got the problem right, it does t really do much i terms of helpig us fid the aswer Istead, we will ot tur to our old frieds: biary strigs! Let s wor with = 10 ad r = 4, ie 10 cadies amog 4 childre, or equivaletly, solutios to x 1 + x 2 + x 3 + x 4 = 10 subject to x 1, x 2, x 3, x 4 0 Let s loo at the biary strig of legth 10 cosistig of all zeros, ad thi of those zeros as cadies We ca ow thi of puttig oes ito the strig as the process of dividig the zeros cadies ito two parts Say we start out with , ad add a oe somewhere i there: This ca be iterpreted as there beig two parts, oe to the left of the oe ad the other to the right of the oe, ad the first part has 3 zeros cadies, ad the secod part has 7 zeros cadies If throw i aother oe, the we get three parts i the same maer: ca be thought of as three parts with part oe ad two havig three zeros each, ad the third part havig 4 zeros Of course there could be parts that are empty, eg, i , the secod part betwee the two oes is empty Now, if we throw i three oes i total, we get a distributio of the 10 zeros ito 4 parts Let s fix the covetio that all the zeros cadies to the left of the first oe go to x 1 or the first child, all the zeros betwee the 1st ad 2d oe go to x 2 the secod child, ad so o Thus, the umber of ways of distributig the 10 cadies betwee 4 childre, or the umber of solutios to the above equatios, is exactly the umber of biary strigs of legth 13 that have 10 zeros ad 3 oes, which we ow usig the subset rule is 13 3 We ca geeralize the above argumet to coclude that the umber of ways of distributig idetical objects amog distict parties is equal to the umber of biary strigs that have exactly zeros ad 1 oes why 1, ad ot? Because a sigle oe created two partitios, two oes creatd three, ad so o, so 1 oes will give us partitios which is Questio I how may ways ca you distribute 20 idivisible gold bars amog 5 pirates so that every pirate gets at least oe bar? 3
4 Proof If we covert this a equatio with costraits we get x 1 + x x 5 = 20 with the costraits that x 1 1, x 2 1,, x 5 1 Ufortuately, the above method oly wors whe we have costraits of the form x 1 0,, x 5 0 To get aroud this, let s first simply satisfy the bare miimum requiremets of all the pirates variables, ie let s give oe bar to each of the pirates variables so that they all have at least oe This meas we are left with 20 5 = 15 bars We ca ow focus o distributig the remaiig 15 bars amog the 5 pirates without havi to worry about ay additioal costraits Notice that ow the equatio would be simply x x 5 = 15 with x 1,, x 5 0, ad we ow that the umber of solutios to this equatio is Ca you geeralize this? Questio I how may ways ca you distribute idivisible gold bars amog pirates so that every pirate gets at least r bars? Sometimes the distributio problems disguise themselves i a very icospicuous maer the oly way to call their bluff is to practice a lot of problems Here is a example: Questio Suppose we roll 10 idetical dice together How may possible outcomes are there? Proof Note that i all the dice are idetical ii there is o order i which we rolled the dice all of them were rolled simultaeously Thus, the oly thig that distiguishes a outcome from aother, or the oly thig that really defies a outcome is the followig set of statistics: how may of the dice tured up 1, how may tured up 2,, how may tured up 6? Let x i be the umber of dice that tured up the umber i here 1 i 6 The we have x x 6 = 10, ad x 1,, x 6 0, ad wat to cout the umber of solutios to this set of equatios We are ow o home turf, ad ca coclude that the aswer must be Note that had the dice bee colored with distict colors, or if they had bee rolled oe at a time, the the problem would be very differet, ad the aswer would simply be 6 10 usig the product rule covice yourself of this! Here is aother oe this oe is from your boo that ca seem totally urelated to distributio problems: Questio S uppose there are 20 boos arraged i a row o a boo shelf I how may ways ca you choose 6 boos so that o two of the chose boos are adjacet to each other o the rac? At first glace, this problem might ot seem to have aythig to do with what we have bee discussig so far A little bit of rephrasig maes this illusio disappear Note that the most obvious way of specifyig a selectio/choice of 6 boos is to literally specify the idex of the boo if oe were to start coutig from 1 startig at the left most boo o the shelf A more o-obvious way would be the followig: specify how may uchose boos there are to the left of the first chose boo, the specify how may uchose boos there are betwee the first ad secod chose boo, the the umber of uchose boos betwee the secod ad third chose boo,, ad fially the umber of uchose boos to the right of the last sixth chose 4
5 boo So, I ca set this up i the followig way: let x 1 deote the umber of boos to the left of the first chose boo, x 2 deote the umber of boos betwee the first ad secod chose boos, ad so o, with x 7 represetig the umber of boos to the right of the sixth chose boo What do coditios do we wat to impose o these variables? Well, first of all there must be 14 uchose boos i all, ad each of those 14 boos must be either betwee two of the chose boos, or the left or right of all the chose boos, ad thus: x 1 + x x 7 = 14 Furthermore, we wat that o two boos be adjacet, so there must be at least oe uchose boo betwee the first ad secod chose boo, so we wat x 2 1, ad similarly we wat x 3,, x 6 1 How about x 1 ad x 7, there is o costrait o them: there could be as low as zero it is possible to choose the first boo from the left o the shelf, or the last boo o the shelf, ad so x 1, x 7 0 Agai, we are bac i familiar territory, so we ca use the machiery we developed earlier i the sectio to fiish the problem 3 Biomial theorem Recall that x + y 2 = x 2 + y 2 + 2xy Actually, there is a lot goig o whe oe tries to derive that: x + y 2 is othig but x + y x + y Sice multiplicatio is distributive over additio, there will be four terms comig from the four pssible multiplicatios, ad the all we be added up Basically, each of the four terms will cosist of exactly oe etry each from the two copies of x + y For the first copy, we have the choice of picig up either x or y, ad we have the same choices for the secod copy This gives 2 2 = 4 terms i total The four terms are xx + xy + yx + yy Now recall that xx = x 2 ad yy = y 2 Also, because of multiplicatio beig commutative we have that xy = yx, ad so we get x 2 + y 2 + 2xy Oe ca ow do the same for higher powers of x + y How about x + y? This is othig but copies of x + y multiplied together Agai, usig distributivity of multiplicatio over additio, we will get 2 terms: there are copies of x + y, ad we have two choices for the first copy, two for the secod copy, ad so o Obviously, as before, may terms will collapse to the same expressio because of commutativity xy = yx, ad the combiig cosecutive xs ad ys ito powers This meas that, i the fial simplified expressio for x + y, differet terms will have differet coefficiets i frot of them depedig o how may of the 2 origial terms collapse to them Let s as the questio, what s the coefficiet of x y? I other words, how may of the 2 iitial terms collapse to x y Clearly, oly those terms that have exactly xs i them will collapse to x y, so how may terms have exactly xs? Recall that we had to pic betwee x ad y i each of the copies of x + y Thus, the terms that give us x y must correspod to outcomes of the picig process where we decided to pic x i exactly of the copies of x + y, ad piced y i the rest How may such outcomes are there? It s exactly the same as decidig i which copies of x + y out of the possible will we pic x, ad there are ways of doig that So the coefficiet of x y must be Sice there was othig special about ad i the above argumet, we ca coclude: 5
6 Theorem 2 Biomial theorem Let 0 be a iteger, the we have that x + y = =0 x y 4 Some properties of biomial coefficiets The biomial theorem lets us derive some iterestig thigs about biomial coefficiets Let us first as the followig questio what is the sum of all biomial coefficiets for a fixed, ie We ca aswer this problem i two ways The first oe is combiatorial: recall that just deoted the umber of size subsets of the set {1,, } So, it seems lie we are addig the umber of subsets of size 0, the umber of subsets of size 1, ad so o up till the umber of subsets of size But if you thi about it this accouts for all possible subsets of {1,, }, ad thus the cout must add up to the total umber of differet possible subsets of {1,, }, which we ow is 2 A more algebraic way of seeig this is tae the statemet of the biomial theorem ad set x = y = 1 What happes if we set y = 1 ad x = 1? The LHS becomes zero, ad we get 0 = is eve ad =0 1 Now otice that 1 becomes 1 wheever is eve, ad becomes 1 wheever is odd, so we ca write: 0 =, ad so is eve ad = is odd ad is odd ad This is aother way of derivig somethig we proved usig the bijectio method before: is eve ad is othig but the umber of eve size subsets of {1,, } ad is odd ad is the umber of odd size subsets of {1,, }, ad the above expressio tells us that there are as may odd size subsets as there are eve size subsets we gave a bijective proof for the case whe was odd, ca you try for eve? We wat to show the followig: < 2 = > 2, ie the umber of subsets of {1,, } of size less tha /2, is the same as the umber of subsets of size more tha /2 I would t give you the whole proof but it follows pretty simply by recallig that = ad so 0 =, 1 = 1, ad so o 6
Math 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 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 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 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 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 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 informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
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 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 informationSection 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 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 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 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 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 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 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 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 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 informationLinear Regression Demystified
Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
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 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 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 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 informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
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 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 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 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 informationSNAP Centre Workshop. Basic Algebraic Manipulation
SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)
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 informationDiscrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions
CS 70 Discrete Mathematics for CS Sprig 2005 Clacy/Wager Notes 21 Some Importat Distributios Questio: A biased coi with Heads probability p is tossed repeatedly util the first Head appears. What is the
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 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 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 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 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 informationPolynomials with Rational Roots that Differ by a Non-zero Constant. Generalities
Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by
More informationsubcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016
subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may
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 informationLecture 4 The Simple Random Walk
Lecture 4: The Simple Radom Walk 1 of 9 Course: M36K Itro to Stochastic Processes Term: Fall 014 Istructor: Gorda Zitkovic Lecture 4 The Simple Radom Walk We have defied ad costructed a radom walk {X }
More informationSummary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function
Summary: Cogrueces j whe divided by, ad determiig the additive order of a iteger mod. As described i the Prelab sectio, cogrueces ca be thought of i terms of coutig with rows, ad for some questios this
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 informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
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 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 informationProblems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:
Math 224 Fall 2017 Homework 4 Drew Armstrog Problems from 9th editio of Probability ad Statistical Iferece by Hogg, Tais ad Zimmerma: Sectio 2.3, Exercises 16(a,d),18. Sectio 2.4, Exercises 13, 14. Sectio
More informationLecture 6 April 10. We now give two identities which are useful for simplifying sums of binomial coefficients.
Lecture 6 April 0 As aother applicatio of the biomial theorem we have the followig. For 0. 0 I other words startig with the secod row ad goig dow if we sum alog the rows alteratig sig as we go the result
More informationFourier Series and the Wave Equation
Fourier Series ad the Wave Equatio We start with the oe-dimesioal wave equatio u u =, x u(, t) = u(, t) =, ux (,) = f( x), u ( x,) = This represets a vibratig strig, where u is the displacemet of the strig
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 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 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 informationDavid Vella, Skidmore College.
David Vella, Skidmore College dvella@skidmore.edu Geeratig Fuctios ad Expoetial Geeratig Fuctios Give a sequece {a } we ca associate to it two fuctios determied by power series: Its (ordiary) geeratig
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 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 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 informationClassroom. We investigate and further explore the problem of dividing x = n + m (m, n are coprime) sheep in
Classroom I this sectio of Resoace, we ivite readers to pose questios likely to be raised i a classroom situatio. We may suggest strategies for dealig with them, or ivite resposes, or both. Classroom is
More informationn outcome is (+1,+1, 1,..., 1). Let the r.v. X denote our position (relative to our starting point 0) after n moves. Thus X = X 1 + X 2 + +X n,
CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 9 Variace Questio: At each time step, I flip a fair coi. If it comes up Heads, I walk oe step to the right; if it comes up Tails, I walk oe
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
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 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 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 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 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 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 information2 Geometric interpretation of complex numbers
2 Geometric iterpretatio of complex umbers 2.1 Defiitio I will start fially with a precise defiitio, assumig that such mathematical object as vector space R 2 is well familiar to the studets. Recall that
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
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 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 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 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 informationSeries: Infinite Sums
Series: Ifiite Sums Series are a way to mae sese of certai types of ifiitely log sums. We will eed to be able to do this if we are to attai our goal of approximatig trascedetal fuctios by usig ifiite degree
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 information1 Last time: similar and diagonalizable matrices
Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero
More informationRADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify
Example 1 Simplify 1.2A Radical Operatios a) 4 2 b) 16 1 2 c) 16 d) 2 e) 8 1 f) 8 What is the relatioship betwee a, b, c? What is the relatioship betwee d, e, f? If x = a, the x = = th root theorems: RADICAL
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 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 informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
More informationLecture 11 April 24. We first prove the case n = 1. Since
Lecture April 4 It frequetly happes that we wat to prove a statemet is true for =,, For istace o the first day we saw that + + = ( +, for We gave a proof for this usig a method of coutig a set of dots
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 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 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 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 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 informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22
CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first
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 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 information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
More information0 1 sum= sum= sum= sum= sum= sum= sum=64
Biomial Coefficiets I how may ways ca we choose elemets from a elemet set? There are choices for the first elemet, - for the secod,..., dow to - + for the th, yieldig *(-)*...*(-+). So there are 4*3=2
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 informationRiemann Sums y = f (x)
Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, o-egative fuctio o the closed iterval [a, b] Fid
More informationMachine Learning Theory Tübingen University, WS 2016/2017 Lecture 12
Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig
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 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 informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
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 informationSome examples of vector spaces
Roberto s Notes o Liear Algebra Chapter 11: Vector spaces Sectio 2 Some examples of vector spaces What you eed to kow already: The te axioms eeded to idetify a vector space. What you ca lear here: Some
More information