Counting Functions and Subsets

Similar documents
MATH /19: problems for supervision in week 08 SOLUTIONS

MATH Midterm Solutions

Lecture 6: October 16, 2017

BINOMIAL THEOREM An expression consisting of two terms, connected by + or sign is called a

BINOMIAL THEOREM NCERT An expression consisting of two terms, connected by + or sign is called a

CHAPTER 5 : SERIES. 5.2 The Sum of a Series Sum of Power of n Positive Integers Sum of Series of Partial Fraction Difference Method

Finite q-identities related to well-known theorems of Euler and Gauss. Johann Cigler

Conditional Convergence of Infinite Products

= 5! 3! 2! = 5! 3! (5 3)!. In general, the number of different groups of r items out of n items (when the order is ignored) is given by n!

Multivector Functions

On a Problem of Littlewood

9.7 Pascal s Formula and the Binomial Theorem

SOME ARITHMETIC PROPERTIES OF OVERPARTITION K -TUPLES

DANIEL YAQUBI, MADJID MIRZAVAZIRI AND YASIN SAEEDNEZHAD

By the end of this section you will be able to prove the Chinese Remainder Theorem apply this theorem to solve simultaneous linear congruences

THE ANALYTIC LARGE SIEVE

The Pigeonhole Principle 3.4 Binomial Coefficients

Using Counting Techniques to Determine Probabilities

The number of r element subsets of a set with n r elements

Einstein Classes, Unit No. 102, 103, Vardhman Ring Road Plaza, Vikas Puri Extn., Outer Ring Road New Delhi , Ph. : ,

Range Symmetric Matrices in Minkowski Space

Ch 3.4 Binomial Coefficients. Pascal's Identit y and Triangle. Chapter 3.2 & 3.4. South China University of Technology

Homework 9. (n + 1)! = 1 1

Advanced Physical Geodesy

On ARMA(1,q) models with bounded and periodically correlated solutions

MATHS FOR ENGINEERS ALGEBRA TUTORIAL 8 MATHEMATICAL PROGRESSIONS AND SERIES

CfE Advanced Higher Mathematics Course materials Topic 5: Binomial theorem

Math 155 (Lecture 3)

Consider unordered sample of size r. This sample can be used to make r! Ordered samples (r! permutations). unordered sample

On randomly generated non-trivially intersecting hypergraphs

Chapter 0. Review of set theory. 0.1 Sets

( ) ( ) ( ) ( ) Solved Examples. JEE Main/Boards = The total number of terms in the expansion are 8.

IDENTITIES FOR THE NUMBER OF STANDARD YOUNG TABLEAUX IN SOME (k, l)-hooks

A NOTE ON DOMINATION PARAMETERS IN RANDOM GRAPHS

Lower Bounds for Cover-Free Families

Greatest term (numerically) in the expansion of (1 + x) Method 1 Let T

a) The average (mean) of the two fractions is halfway between them: b) The answer is yes. Assume without loss of generality that p < r.

EVALUATION OF SUMS INVOLVING GAUSSIAN q-binomial COEFFICIENTS WITH RATIONAL WEIGHT FUNCTIONS

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O

Permutations and Combinations

ICS141: Discrete Mathematics for Computer Science I

Math 7409 Homework 2 Fall from which we can calculate the cycle index of the action of S 5 on pairs of vertices as

( ) 1 Comparison Functions. α is strictly increasing since ( r) ( r ) α = for any positive real number c. = 0. It is said to belong to

Using Difference Equations to Generalize Results for Periodic Nested Radicals

4. PERMUTATIONS AND COMBINATIONS Quick Review

2012 GCE A Level H2 Maths Solution Paper Let x,

Taylor Transformations into G 2

A note on random minimum length spanning trees

Steiner Hyper Wiener Index A. Babu 1, J. Baskar Babujee 2 Department of mathematics, Anna University MIT Campus, Chennai-44, India.

Lecture 24: Observability and Constructibility

Solution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1

Homework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger.

SHIFTED HARMONIC SUMS OF ORDER TWO

Complementary Dual Subfield Linear Codes Over Finite Fields

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

ON EUCLID S AND EULER S PROOF THAT THE NUMBER OF PRIMES IS INFINITE AND SOME APPLICATIONS

RECIPROCAL POWER SUMS. Anthony Sofo Victoria University, Melbourne City, Australia.

Math F215: Induction April 7, 2013

PROGRESSION AND SERIES

Lecture 3 : Concentration and Correlation

KEY. Math 334 Midterm II Fall 2007 section 004 Instructor: Scott Glasgow

Technical Report: Bessel Filter Analysis

Generalized Fibonacci-Lucas Sequence

HOMEWORK #4 - MA 504

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Cardinality Homework Solutions

Math 2112 Solutions Assignment 5

( m is the length of columns of A ) spanned by the columns of A : . Select those columns of B that contain a pivot; say those are Bi

Progression. CATsyllabus.com. CATsyllabus.com. Sequence & Series. Arithmetic Progression (A.P.) n th term of an A.P.

ON CERTAIN CLASS OF ANALYTIC FUNCTIONS

Exercises 1 Sets and functions

Some Integral Mean Estimates for Polynomials

I PUC MATHEMATICS CHAPTER - 08 Binomial Theorem. x 1. Expand x + using binomial theorem and hence find the coefficient of

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

Math 140A Elementary Analysis Homework Questions 1

Measure and Measurable Functions

ELEMENTARY AND COMPOUND EVENTS PROBABILITY

ANSWERS TO MIDTERM EXAM # 2

Enumerative & Asymptotic Combinatorics

} is said to be a Cauchy sequence provided the following condition is true.

Sums of Involving the Harmonic Numbers and the Binomial Coefficients

EDEXCEL NATIONAL CERTIFICATE UNIT 28 FURTHER MATHEMATICS FOR TECHNICIANS OUTCOME 2- ALGEBRAIC TECHNIQUES TUTORIAL 1 - PROGRESSIONS

Auchmuty High School Mathematics Department Sequences & Series Notes Teacher Version

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

SOLVED EXAMPLES

Zero Level Binomial Theorem 04

The multiplicative structure of finite field and a construction of LRC

We show that every analytic function can be expanded into a power series, called the Taylor series of the function.

LECTURE NOTES, 11/10/04

Fermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a.

Some Properties of the K-Jacobsthal Lucas Sequence

Lecture 23: Minimal sufficiency

Metric Space Properties

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

What is Probability?

MT5821 Advanced Combinatorics

Combinatorics and Newton s theorem

COUNTING SUBSET SUMS OF FINITE ABELIAN GROUPS

EXAMPLES. Leader in CBSE Coaching. Solutions of BINOMIAL THEOREM A.V.T.E. by AVTE (avte.in) Class XI

4. PERMUTATIONS AND COMBINATIONS

Transcription:

CHAPTER 1 Coutig Fuctios ad Subsets This chapte of the otes is based o Chapte 12 of PJE See PJE p144 Hee ad below, the efeeces to the PJEccles book ae give as PJE The goal of this shot chapte is to itoduce the vey impotat umbes, called the biomial coefficiets, ad to pove the Biomial Theoem The biomial coefficiets have may uses i mathematics beyod the biomial theoem i combiatoics, pobability, statistics; they ae eve liked to the Riema hypothesis I this couse they will, fo example, be used i oe of the poofs of Femat s Little Theoem O the way, we itoduce the sets Fu(A, B ad Ij (A, B ad evisit the powe set P(A they ae combiatoial objects impotat i thei ow ight Notatio (PJE defiitios 1213 ad 1215 Give sets X ad Y, deote by Fu (X, Y the set of all fuctios fom X to Y ad by Ij (X, Y the set of all ijectios fom X to Y 11 Popositio (PJE popositios 1212 ad 1214 Let X, Y be fiite sets The ad if m = X Y =, the Fu (X, Y = Y X Ij (X, Y = ( 1 ( m + 1 =! ( m! Poof: See PJE pp 145, 146 But hee I give a o-igoous explaatio why the two fomulas ae tue, i tems of the umbe of choices of fuctios We may assume that X = N m, so that a fuctio f : X Y ca be witte i two-lie otatio: we wite ( 1 2 m a 1 a 2 a m to say that f(1 = a 1, f(2 = a 2 ad so o Hece the set Fu(X, Y has as may elemets as m-tuples (a 1, a 2,, a m of elemets of Y Such m-tuples fo the set Y Y Y = Y m, the Catesia poduct of m copies of Y, of cadiality Y m = Y X 1

Coutig Fuctios ad Subsets 2 Ijective fuctios f : X Y coespod, i two-lie otatio, to m-tuples (a 1, a 2,, a m whee all the eties ae distict elemets of Y Note that a 1 ca be chose i ways; to each choice of a 1 thee coespod 1 possible choices of a 2, so that (a 1, a 2 ca be chose i ( 1 ways Similaly, (a 1, a 2, a 3 ca be chose i ( 1( 2 ways Cotiuig i the same way, we coclude that thee ae ideed ( 1 ( m + 1 choices fo (a 1, a 2,, a m ( 1 2 Example Ijective fuctios fom N 2 to {a, b, c} ae, i two-lie otatio,, a b ( ( ( ( ( 1 2 1 2 1 2 1 2 1 2,,, ad Oe has Ij (N 2, {a, b, c} = 6 which a c b c b a c a c b 3! agees with the value give by the Popositio The set Fu(N 2, {a, b, c} (3 2! ( ( ( 1 2 1 2 1 2 cotais thee o-ijective fuctios,, ad Oe thus has a a b b c c Fu(N 2, {a, b, c} = 9 which is 3 2 as i the Popositio Notatio (PJE defiitio 631 Fo a set A we deote by P (A the powe set of A, which is the collectio of all subsets of A 12 Popositio (PJE theoem 1221 If A is a fiite set, the P (A = 2 A Poof: give C A, costuct a fuctio f : A {0, 1} defied by f(x = 1 if x C, f(x = 0 if x / C The each subset of A coespods to a fuctio i Fu(A, {0, 1}, ad each f Fu(A, {0, 1} coespods to a uique set C = {x A : f(x = 1} We coclude that P(A = Fu(A, {0, 1} which is 2 A by the pevious Popositio Notatio (PJE defiitio 1224 Let P (A deote the collectio of all subsets of A cotaiig exactly elemets P (A = {C A : C = }, o, equivaletly, P (A = {C P (A : C = }

Coutig Fuctios ad Subsets 3 Defiitio (PJE defiitio 1224 The biomial umbe o biomial coefficiet, ead as choose, is the cadiality P (A fo ay set A of cadiality, ie = P (A Example (see also PJE example 1225 If A = {a, b, c, d, e} the P 3 (A = { {a, b, c}, {a, b, d}, {a, b, e}, {a, c, d}, {a, c, e}, {a, d, e}, {b, c, d}, {b, c, e}, {b, d, e}, {c, d, e} } ( 5 Also, P 0 (A = { } ad P 5 (A = {A} We obseve that P 3 (A = 10 so = 10 3 Remak: some special cases of the biomial coefficiets If A = the P 0 (A = { } ad P (A = {A}, hece = 1 = 0 fo all 0 Fially, let us ote that if < 0 o >, the set A has o subsets of cadiality, ie, P (A = This implies that = 0 if < 0 o > Questio Does this defiitio of biomial umbe deped o the choice of set A? Aswe No, thakfully ot! The biomial umbe is well-defied, ie, P (A does ot deped o the choice of a set A, as log as A has cadiality See PJE p149 Remak Of couse, witig dow all the ( -elemet subsets of a -elemet set is a extemely iefficiet way to calculate We will peset two useful ways, oe iductive, the othe via a fomula usig factoials 13 Popositio Iductive fomula fo Fo all 1 ad all, = ( 1 + (PJE popositio 1228 1 1

Coutig Fuctios ad Subsets 4 Poof: Each oe of the subsets C of N = {1,, } with C = belogs to oe of the two disjoit classes: C Equivaletly, C P (N 1 C Equivaletly, C = C {} with C P 1 (N 1 ( ( 1 It follows that = P (N 1 + P 1 (N 1, which is + 1 1 The esult of Popositio 13 is usually epeseted as a uedig tiagle whee each tem, apat fom those at the ed of the ows, ae the sum of the two tems i the lie above Defiitio Pascal s Tiagle ( 0 ( 0 0 ( 1 ( 1 0 1 ( 2 ( 2 ( 2 0 1 2 ( 3 ( 3 ( 3 ( 3 0 1 2 3 ( 1 ( 0 1 ( 1 ( 1 1 ( 1 ( 1 1 1 1 2 1 The stat of this is omally witte as 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1 We ae eady to pove by iductio the famous 14 Theoem Biomial Theoem (PJE theoem 1231 Let a, b R Fo all 0 we have (a + b = i=0 a i b i i Remak The ight-had side ca also be witte as a + a 1 b + ( 2 a 2 b 2 + + ( 2 a 2 b 2 + ab 1 + b We use the covetio that x 0 = 1 fo all x

Coutig Fuctios ad Subsets 5 Poof Let P ( deote the statemet of the Theoem fo The P (0 eads 1 = 1 (tue Assume k 1 ( P (k 1 : (a + b k 1 k 1 = a k 1 i b i i i=0 to be tue ad wite (a + b k = (a + b (a + b k 1 = a (a + b k 1 + (a + b k 1 b The oly tems a s b t o the ight ae those with s + t = k, ad the tem a k i b i ca occu i two possible ways: ( k 1 as a(a k 1 i b i, whose coefficiet of i a(a + b k 1 is by P (k 1; i( k 1 as (a (k 1 (i 1 b i 1 b, whose coefficiet i (a + b k 1 b is by P (k 1 i 1 ( ( ( k 1 k 1 k Hece the coefficiet of a k i b i i (a + b k is + which equals by i i 1 i Popositio 13 Thus, P (k is tue By iductio i, P ( is tue fo all 0 We ow deduce the well-kow 15 Theoem Factoial fomula fo = (PJE theoem 12210!! (! fo all 0 ad 0, with the covetio that 0! = 1 Poof The theoem is poved i PJE but hee I give a diffeet poof (It would be useful fo the studets to study both the PJE poof ad the poof give hee Fo the exam, it will be sufficiet to kow oe poof Coside the polyomial ( p(x = (1 + x By the Biomial Theoem, p(x = a 0 + a 1 x + + a x whee a = But the coefficiet a ca also be foud as a = p( (0,! whee p ( is the th deivative of p [MATH10201 Calculus ad Vectos A] Sice oe has ( p (x = (1 + x 1, p (x = ( 1(1 + x 2, p ( (x = ( 1 ( + 1(1 + x = = a = 1!! (! (1 + 0 =! (! (1 + x,!! (!

Coutig Fuctios ad Subsets 6 Advice fo exam Theoem 14 is the Biomial Theoem, ot Popositio 13 o Theoem 15 16 Example Fom the sixth lie i Pascal s tiagle we see (a + b 5 = a 5 + 5a 4 b + 10a 3 b 2 + 10a 2 b 3 + 5ab 4 + b 5 The coefficiet of a 7 b 3 i (2a + b 10 is ( 10 2 7 = 2 7 10! 10 9 8 = 128 = 15360 3 3!7! 3 2