5.3. Generalized Permutations and Combinations



Similar documents
1. MATHEMATICAL INDUCTION

BINOMIAL EXPANSIONS In this section. Some Examples. Obtaining the Coefficients

CS103X: Discrete Structures Homework 4 Solutions

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

Infinite Sequences and Series

Section 8.3 : De Moivre s Theorem and Applications

Elementary Theory of Russian Roulette

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

Soving Recurrence Relations

2-3 The Remainder and Factor Theorems

Department of Computer Science, University of Otago

Properties of MLE: consistency, asymptotic normality. Fisher information.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

1 Computing the Standard Deviation of Sample Means

Hypergeometric Distributions

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE The absolute value of the complex number z a bi is

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

Solving Logarithms and Exponential Equations

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

Permutations, the Parity Theorem, and Determinants

A probabilistic proof of a binomial identity

A Recursive Formula for Moments of a Binomial Distribution

Solutions to Exercises Chapter 4: Recurrence relations and generating functions

PERMUTATIONS AND COMBINATIONS

Asymptotic Growth of Functions

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

Confidence Intervals for One Mean

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

1 Correlation and Regression Analysis

Lesson 15 ANOVA (analysis of variance)

Sampling Distribution And Central Limit Theorem

How To Solve The Homewor Problem Beautifully

Basic Elements of Arithmetic Sequences and Series

Notes on exponential generating functions and structures.


S. Tanny MAT 344 Spring be the minimum number of moves required.

Factors of sums of powers of binomial coefficients

3. Greatest Common Divisor - Least Common Multiple

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Section 11.3: The Integral Test

SEQUENCES AND SERIES

Your organization has a Class B IP address of Before you implement subnetting, the Network ID and Host ID are divided as follows:

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006

Chapter 5: Inner Product Spaces

GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

I. Chi-squared Distributions

Notes on Combinatorics. Peter J. Cameron

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?

A Mathematical Perspective on Gambling

Multiplexers and Demultiplexers

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

5 Boolean Decision Trees (February 11)

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find

NATIONAL SENIOR CERTIFICATE GRADE 12

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return

Lesson 17 Pearson s Correlation Coefficient

The Stable Marriage Problem

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.

Determining the sample size

Listing terms of a finite sequence List all of the terms of each finite sequence. a) a n n 2 for 1 n 5 1 b) a n for 1 n 4 n 2

Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu>

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Simple Annuities Present Value.

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Solutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork

Chapter 7 Methods of Finding Estimators

CHAPTER 3 DIGITAL CODING OF SIGNALS

FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10

4.3. The Integral and Comparison Tests

AP Calculus BC 2003 Scoring Guidelines Form B

THE HEIGHT OF q-binary SEARCH TREES

5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized?

Hypothesis testing. Null and alternative hypotheses

Math C067 Sampling Distributions

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series

Learning objectives. Duc K. Nguyen - Corporate Finance 21/10/2014

Lecture 4: Cheeger s Inequality

GCE Further Mathematics (6360) Further Pure Unit 2 (MFP2) Textbook. Version: 1.4

Present Value Factor To bring one dollar in the future back to present, one uses the Present Value Factor (PVF): Concept 9: Present Value

Lecture 2: Karger s Min Cut Algorithm

5: Introduction to Estimation

CHAPTER 3 THE TIME VALUE OF MONEY

CHAPTER 11 Financial mathematics

Part - I. Mathematics

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution

Multiple Representations for Pattern Exploration with the Graphing Calculator and Manipulatives

Solving equations. Pre-test. Warm-up

Domain 1: Designing a SQL Server Instance and a Database Solution


7.1 Finding Rational Solutions of Polynomial Equations

HOW MANY TIMES SHOULD YOU SHUFFLE A DECK OF CARDS? 1

A Note on Sums of Greatest (Least) Prime Factors

Transcription:

53 GENERALIZED PERMUTATIONS AND COMBINATIONS 73 53 Geeralized Permutatios ad Combiatios 53 Permutatios with Repeated Elemets Assume that we have a alphabet with letters ad we wat to write all possible words cotaiig times the first letter of the alphabet, times the secod letter,, times the th letter How may words ca we write? We call this umber P (;,,,, where + + + Example: With 3 a s ad b s we ca write the followig 5-letter words: aaabb, aabab, abaab, baaab, aabba, ababa, baaba, abbaa, babaa, bbaaa We may solve this problem i the followig way, as illustrated with the example above Let us distiguish the differet copies of a letter with subscripts: a a a 3 b b Next, geerate each permutatio of this five elemets by choosig the positio of each id of letter, the the subscripts to place o the 3 a s, the 3 these subscripts to place o the b s Tas ca be performed i P (5; 3, ways, tas ca be performed i 3! ways, tas 3 ca be performed i! By the product rule we have 5! P (5; 3, 3!!, hece P (5; 3, 5!/3!! I geeral the formula is: P (;,,,!!!! 53 Combiatios with Repetitio Assume that we have a set A with elemets Ay selectio of r objects from A, where each object ca be selected more tha oce, is called a combiatio of objects tae r at a time with repetitio For istace, the combiatios of the letters a, b, c, d tae 3 at a time with repetitio are: aaa, aab, aac, aad, abb, abc, abd, acc, acd, add, bbb, bbc, bbd, bcc, bcd, bdd, ccc, ccd, cdd, ddd Two combiatios with repetitio are cosidered idetical if they have the same elemets repeated the same umber of times, regardless of their order Note that the followig are equivalet: The umber of combiatios of objects tae r at a time with repetitio

53 GENERALIZED PERMUTATIONS AND COMBINATIONS 74 The umber of ways r idetical objects ca be distributed amog distict cotaiers 3 The umber of oegative iteger solutios of the equatio: x + x + + x r Example: Assume that we have 3 differet (empty mil cotaiers ad 7 quarts of mil that we ca measure with a oe quart measurig cup I how may ways ca we distribute the mil amog the three cotaiers? We solve the problem i the followig way Let x, x, x 3 be the quarts of mil to put i cotaiers umber, ad 3 respectively The umber of possible distributios of mil equals the umber of o egative iteger solutios for the equatio x + x + x 3 7 Istead of usig umbers for writig the solutios, we will use stroes, so for istace we represet the solutio x, x, x 3 4, or + + 4, lie this: + + Now, each possible solutio is a arragemet of 7 stroes ad plus sigs, so the umber of arragemets is P (9; 7, 9!/7!! ( 9 7 The geeral solutio is: P ( + r ; r, ( + r! r! (! ( + r r

54 BINOMIAL COEFFICIENTS 75 54 Biomial Coefficiets 54 Biomial Theorem The followig idetities ca be easily checed: (x + y 0 (x + y x + y (x + y x + xy + y (x + y 3 x 3 + 3 x y + 3 xy + y 3 They ca be geeralized by the followig formula, called the Biomial Theorem: ( (x + y x y 0 ( ( ( x + x y + x y + 0 We ca fid this formula by writig (x + y (x + y (x + y + ( xy + ( factors (x + y, ( y expadig, ad groupig terms of the form x a y b Sice there are factors of the form (x + y, we have a + b, hece the terms must be of the form x y The coefficiet of x y will be equal to the umber of ways i which we ca select the y from ay of the factors (ad the x from the remaiig factors, which is C(, ( The expressio ( is ofte called biomial coefficiet Exercise: Prove ( ad 0 ( ( 0 0 Hit: Apply the biomial theorem to ( + ad ( 54 Properties of Biomial Coefficiets The biomial coefficiets have the followig properties: ( (

( + + 54 BINOMIAL COEFFICIENTS 76 ( + ( + The first property follows easily from (!!(! The secod property ca be proved by choosig a distiguished elemet a i a set A of + elemets The set A has ( + + subsets of size + Those subsets ca be partitioed ito two classes: that of the subsets cotaiig a, ad that of the subsets ot cotaiig a The umber of subsets cotaiig a equals the umber of subsets of A {a} of size, ie, ( The umber of subsets ot cotaiig a is the umber of subsets of A {a} of size +, ie, ( + Usig the sum priciple we fid that i fact ( ( + + ( + + 543 Pascal s Triagle The properties show i the previous sectio allow us to compute biomial coefficiets i a simple way Loo at the followig triagular arragemet of biomial coefficiets: ( 0 ( ( ( 3 ( 3 ( 3 ( 3 4 3 ( 4 0 3 4 We otice that each biomial coefficiet o this arragemet must be the sum of the two closest biomial coefficiets o the lie above it This together with ( ( 0, allows us to compute very quicly the values of the biomial coefficiets o the arragemet: 3 3 4 6 4 This arragemet of biomial coefficiets is called Pascal s Triagle Although it was already ow by the Chiese i the XIV cetury

55 THE PIGEONHOLE PRINCIPLE 77 55 The Pigeohole Priciple 55 The Pigeohole Priciple The pigeohole priciple is used for provig that a certai situatio must actually occur It says the followig: If pigeoholes are occupied by m pigeos ad m >, the at least oe pigeohole is occupied by more tha oe pigeo Example: I ay give set of 3 people at least two of them have their birthday durig the same moth Example: Let S be a set of eleve -digit umbers Prove that S must have two elemets whose digits have the same differece (for istace i S {0, 4, 9,, 6, 8, 49, 53, 70, 90, 93}, the digits of the umbers 8 ad 93 have the same differece: 8 6, 9 3 6 Aswer: The digits of a two-digit umber ca have 0 possible differeces (from 0 to 9 So, i a list of umbers there must be two with the same differece Example: Assume that we choose three differet digits from to 9 ad write all permutatios of those digits Prove that amog the 3-digit umbers writte that way there are two whose differece is a multiple of 500 Aswer: There are 9 8 7 504 permutatios of three digits O the other had if we divide the 504 umbers by 500 we ca get oly 500 possible remaiders, so at least two umbers give the same remaider, ad their differece must be a multiple of 500 Exercise: Prove that if we select + umbers from the set S {,, 3,, }, amog the umbers selected there are two such that oe is a multiple of the other oe The Pigeohole Priciple (Schubfachprizip was first used by Dirichlet i Number Theory The term pigeohole actually refers to oe of those old-fashioed writig dess with thi vertical woode partitios i which to file letters