Week 5-6: The Binomial Coefficients

Size: px
Start display at page:

Download "Week 5-6: The Binomial Coefficients"

Transcription

1 Wee 5-6: The Biomial Coefficiets March 6, Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers are 1, 5, 12, 22,, defied as the umbers of poits of dilated petagos The a a for 1 with a 0 1 The a , 1 The -go umbers are 1,, 3 3, 6 8, The umbers ( 3 ( 1( 2 6 ( 3 are tetrahedral umbers, ie, ( 3 is the umber of lattice poits of the tetrahedro 3 ( defied by 3 ( {(x, y, z : x 0, y 0, z 0, x + y + z 3} Theorem 12 The umber of odecreasig coordiate paths from (0, 0 to (m, with m, 0 equals ( m + m 2 Biomial Theorem Theorem 21 (Biomial Expasio For iteger 1 ad variables x ad y, ( (x + y x y, (1 + x 0 0 ( x 1

2 3 Biomial Idetities Defiitio 31 For ay real umber α ad iteger, defie the biomial coefficiets ( α 0 if < 0 1 if 0 α(α 1 (α + 1/! if > 0 Propositio 32 (1 For real umber α ad iteger, ( ( α α 1 + ( α 1 1 (2 For real umber α ad iteger, ( ( α α 1 α 1 (3 For oegative itegers m,, ad such that m +, ( m + ( ( m i i Propositio 33 For itegers, 0, ( i0 m0 ( m Proof Applyig the Pascal formula agai ad agai, we have ( ( ( ( ( ( ( ( ( Note that ( Multiomial Theorem ( Theorem 41 (Multiomial Expasio For ay positive iteger, ( (x 1 + x x 1, 2,, , 2,, 0 2 x 1 1 x 2 2 x,

3 where the coefficiets ( 1, 2,, are called multiomial coefficiets Proof! 1! 2!! (x 1 + x x (x 1 + x x (x 1 + x x }{{} u 1 u 2 u (u i x 1, x 2, x, 1 i { } umber of permutatios of the multiset { 1 x 1, 2 x 2,, x } , 2,, , 2,, 0 ( 1, 2,, x 1 1 x 2 2 x 5 Newto Biomial Theorem Theorem 51 (Newto s Biomial Expasio Let α be a real umber If 0 x < y, the ( α (x + y α x y α, where ( α 0 α(α 1 (α + 1! Proof Apply the Taylor expasio formula for the fuctio (x+y α of two variables Corollary 52 If z < 1, the ( α (1 + z α 0 1 (1 z ( α α The idetity 0 ( α z, ( z ( α + 1 z 0 ( α + 1 ( 1 is called the reciprocity law of biomial coefficiets 3

4 Proof Apply the Taylor expasio formula I particular, sice 1 1 z i0 zi, we have 1 (1 z ( i z z i 1 ( i 1 + +i i 0 1 ( + 1 z This shows agai that the umber of oegative iteger solutios of the equatio x 1 + x x z i equals the biomial coefficiet ( Uimodality of Biomial Coefficiets Defiitio 61 A sequece s 0, s 1, s 2,, s is said to be uimodal if there is a iteger (0 such that s 0 s 1 s s +1 s Theorem 62 Let be a positive iteger The sequece of biomial coefficiets ( ( ( (,,,, is a uimodal sequece More precisely, if is eve, ( ( ( ( ( < < < > > > ; 0 1 /2 1 ad if is odd, ( ( < 0 1 ( < < Proof Note that the quotiet ( /( 1 ( 1/2 The uimodality follows immediately ( ( + 1/2 ( > > > 1 { 1 if ( + 1/2 1 if ( + 1/2 (

5 A sequece s 0, s 1,, s of positive umbers is said to be log-cocave if s 2 i s i 1 s i+1, i 1,, 1 The coditio implies that the sequece log s 1, log s 2,, log s are cocave, ie, log s i (log s i 1 + log s i+1 /2 Propositio 63 If a sequece (s i is log-cocace, the it is uimodal Proof Assume the sequece is ozero The coditio s 2 i s i 1s i+1 is equivalet to s i 1 s i s i s i+1 If there exists a i 0 such that s i0 s i0 +1, ie, s i0 s i0 +1 1, the s i 1 s i s 0 s 1 s i0 s i0 +1 If there exists a i 0 such that s i0 1 s i0, ie, s i 0 1 s i0 ie, s i0 1 s i0 s 1 s 1 for all i i 0, ie, 1, the the s i 1 s i 1 for all i i 0, Now for the odecreasig umbers s i s i+1, there exists a idex i 0 such that s i0 1 1 s i 0 s i0 s i0 +1 It follows that s 0 s 1 s i0 s i0 +1 s The sequece s i ( i of biomial coefficiets is log-cocave I fact, s 2 i s i 1 s i+1 ( i + 1(i + 1 i( i > 1, i 1,, 1 Give a graph G with vertices A colorig of G with t colors is said to be proper if o two adjacet vertices receive the same color The umber of proper colorigs turs out to be a polyomial fuctio of t, called the chromatic polyomial of G, deoted χ(g, t, ad it ca be writte as the form χ(g, t ( 1 a t 0 Cojecture 64 (Log-Cocavity Cojecture The coefficiets of the above chromatic polyomial satisfies the log-cocave equality: a 2 a 1 a +1 Whe the iequalities are strict iequalities, it is called the Strict Log-Cocavity Cojecture 5

6 A cluster of a set S is a collectio A of subsets of S such that o oe is cotaied i aother A chai is a collectio C of subsets of S such that for ay two subsets, oe subset is always cotaied i aother subset For example, for S {a, b, c, d}, the collectio { } A {a, b}, {b, c, d}, {a, c}, {a, d} is a cluster; while the collectio { } C, {b, d}, {a, b, d}, {a, b, c, d} is a chai I more geeral cotext, a cluster is a atichai of a partially ordered set ( Theorem 65 (Sperer Every cluster of a -set S cotais at most /2 subsets of S Proof Let S {1, 2,, } We actually prove the followig stroger result by iductio o : The power set P (S ca be partitioed ito disjoit chais C 1, C 2,, C m with ( m /2 If so, the for each cluster A of S, Cosequetly, For 1, For 2, A A C i 1 for all 1 i m A m m C i A C i m i1 ( /2 ( 1 0 1, ( /2 ( 2 1 2, i1 {1} {1} {1, 2}, ( /2 For 3, ( /2 ( 3 1 3, {2} {1} {1, 2} {1, 2, 3}, {2} {2, 3}, {3} {1, 3} 6

7 ( For 4, /2 ( The 6 chais ca be obtaied i two ways: (i Attach a ew subset at the ed to each chai of the chai partitio for 3 (this ew subset is obtaied by appedig 4 to the last subset of the chai; (ii delete the last subsets i all chais of the partitio for 3 ad apped 4 to all the remaiig subsets {1} {1, 2} {1, 2, 3} {1, 2, 3, 4}, {2} {2, 3} {2, 3, 4}, {3} {1, 3} {1, 3, 4}, {4} {1, 4} {1, 2, 4}, {2, 4}, {3, 4} Note that the chai partitio satisfies the properties: (i Each chai is saturated i the sese that o subset ca be added i betwee ay two cosecutive subsets; (ii i each chai the size of the begiig subset plus the size of the edig subset equals A chai partitio satisfyig the two properties is called a symmetric chai partitio The above chai partitios for 1, 2, 3, 4 are symmetric chai partitios Give a symmetric chai partitio for the case 1; we costruct a symmetric chai partitio for the case : For each chai A 1 A 2 A i the chai partitio for the case 1, if 2, do A 1 A 2 A A {}, ad A 1 {} A 2 {} A 1 {}; if 1, do A 1 A 1 {} It is clear that the chais costructed form a symmetric chai partitio I fact, the chais costructed are obviously saturated Sice A 1 + A 1, the A 1 + A {} A 1 + A + 1, ad whe 2, A 1 {} + A 1 {} A 1 + A A 1 + A + 1 Now for each chai B 1 B 2 B l of the symmetric chai partitio for the case, sice B 1 B l, we must have B 1 /2 B l (otherwise, if B l < /2 the B 1 + B 2 <, or if B 1 > /2 the B 1 + B l > By defiitio of /2 ad /2, we have B 1 /2 /2 B l This meas that B 1 B 2 B l cotais exactly oe /2 -subset ( ad exactly oe /2 -subset Note that the umber of /2 -subsets of S is /2 ad the umber of /2 -subsets of S is It follows that the umber of chais i the costructed ( /2 7

8 symmetric chai partitio is ( /2 ( ( /2 /2 Thus every cluster of the power set P (S has size less tha or equal to cluster P /2 (S is of size ( /2 The The proof of the Specer theorem actually gives the costructio of clusters of maximal size Whe eve, there is oly oe such cluster, P (S : the collectio of all 2 2-subsets of S; ad whe odd, there are exactly two such clusters, P 1 2 P (S : the collectio of all 2 -subsets of S, ad +1 (S : the collectio of all 2 -subsets of S Example 61 (a Let S {1} The 1 ad ( ( There are two clusters: ad {1} (b Let S {1, 2} The 2 ad ( There is oly oe cluster of maximal size: { {1}, {2} } (c Let S {1, 2, 3} The 3 ad ( ( There are two clusters of maximal size: { } { } {1}, {2}, {3} ad {1, 2}, {1, 3}, {2, 3} (d Let S {1, 2, 3, 4} The 4 ad ( There is oly oe cluster of maximal size: { } {1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4} (e Let S {1, 2, 3, 4, 5} The 5 ad ( ( There are two clusters of maximal size: { } {1, 2}, {1, 3}, {1, 4}, {1, 5}, {2, 3}, {2, 4}, {2, 5}, {3, 4}, {3, 5}, {4, 5}, { {1, 2, 3}, {1, 2, 4}, {1, 2, 5}, {1, 3, 4}, {1, 3, 5}, {1, 4, 5}, {2, 3, 4}, {2, 3, 5}, {2, 4, 5}, {3, 4, 5 7 Dilworth Theorem Let (X, be a fiite partially ordered set A subset A of X is called a atichai if ay two elemets of A are icomparable I cotrast, a chai is a subset C of X whose ay two elemets are comparable Thus a chai is a liearly ordered subset of X It is 8

9 clear that ay subset of a chai is also a chai, ad ay subset of a atichai is also a atichai The importat coectio betwee chais ad atichais is: A C 1 for ay atichai A ad chai C Example 71 Let X {1, 2,, 10} The divisibility maes X ito a partially ordered set The subsets {2, 3, 5, 7}, {2, 5, 7, 9}, {3, 4, 5, 7}, {3, 4, 7, 10}, {3, 5, 7, 8}, {3, 7, 8, 10}, {4, 5, 6, 7, 9}, {4, 6, 7, 9, 10}, {5, 6, 7, 8, 9}, {6, 7, 8, 9, 10} are atichais, they are actually maximal atichais; while the subsets {1, 2, 4, 8}, {1, 3, 6}, {1, 3, 9}, {1, 5, 10}, {1, 7} are chais ad they are actually maximal chais Let (X, be a fiite poset We are iterested i partitioig X ito disjoit uio of atichais ad partitioig X ito disjoit uio of chais Let A be a atichai partitio of X ad let C be a chai of X Sice o two elemets of C ca be cotaied i ay atichai i A, the A C Similarly, for ay chai partitio C ad a atichai A of X, there are o two elemets of A belogig to a chai of C, we the have C A Theorem 71 Let (X, be a fiite poset, ad let r be the largest size of a chai The X ca be partitioed ito r but o fewer atichais I other words, mi { A : A is a atichai partitio } max { C : C is a chai } Proof It is eough to show that X ca be partitioed ito r atichais Let X 1 X ad let A 1 be the set of all miimal elemets of X 1 Let X 2 X 1 A 1 ad let A 2 be the set of all miimal elemets of X 2 Let X 3 X 2 A 2 ad let A 3 be the set of all miimal elemets of X 3 Cotiuig this procedure we obtai a decompositio of X ito atichais A 1, A 2,, A p By the previous argumet we always have p r O the other had, for ay a p A p, there is a elemet a p 1 A p 1 such that a p 1 < a p Similarly, there is a elemet a p 2 A p 2 such that a p 2 < a p 1 Cotiuig this process we obtai a chai a 1 < a 2 < < a p Sice r is the largest size of a chai, we the have r p Thus p r The followig dual versio of the theorem is ow as the Dilworth Theorem 9

10 Theorem 72 (Dilworth Let (X, be a fiite poset Let s be the largest size of a atichai The X ca be partitioed ito s, but ot less tha s, chais I other words, mi { C : C is a chai partitio } max { A : A is a atichai } Proof It suffices to show that X ca be partitioed ito s chais We proceed by iductio o X Let X For 1, it is trivially true Assume that 2 Let A mi be the set of all miimal elemets of X, ad A max the set of all maximal elemets of X Both A mi ad A max are maximal atichais We divide the situatio ito two cases Case 1 A mi ad A ma are the oly maximal atichais of X Tae a elemet x A mi ad a elemet y A ma such that x y (possibly x y Let X X {x, y} If X, the X {x, y} ad x < y, thus s 1 ad x < y is the required chai partitio Assume X, the X has oly the maximal atichais A mi {x} ad A max {y} The largest size of atichais of X is s 1 Sice X 1, by iductio the set X ca be partitioed ito s 1 chais C 1,, C s 1 Set C s {x y} The collectio {C 1,, C s } is a chai partitio of X Case 2 The set X has a maximal atichai A {a 1, a 2,, a s } of size s such that A A mi ad A A ma Let A A + {x X : x a i for some a i A}, {x X : x a i for some a i A} The sets A + ad A satisfy the followig properties: 1 A + X (Sice A mi A, ie, there is a miimal elemet ot i A; this miimal elemet caot be i A +, otherwise, it is larger tha oe elemet of A by defiitio 2 A X (Sice A max A, ie, there is a maximal elemet ot i A; this maximal elemet caot be i A, otherwise, it is smaller tha oe elemet of A by defiitio 3 A A + A (It is always true that A A + A For each x A + A, there exist a i, a j A such that a i x a j by defiitio, the a i a j, which implies a i a j so that i j, thus x a i a j A 4 A A + X (Suppose there is a elemet x A A +, the x is either ahead or behid ay member of A, thus A {x} is a atichai of larger size tha A Sice A ad A + are smaller posets havig the maximal atichai A of size s, the by iductio, by iductio A ca be partitioed ito s chais C1, C 2,, C s with the maximal elemets a 1, a 2,, a s respectively, ad A + ca be partitioed ito s chais C 1 +, C+ 2,, C+ s with the miimal elemets a 1, a 2,, a s respectively Thus we obtai a partitio of X ito s chais C 1 C+ 1, C 2 C+ 2,, C s C + s 10

11 Example 72 Let X {1, 2,, 20} be the poset with the partial order of divisibility The the subset {1, 2, 4, 8, 16} is a chai of maximal size The set X ca be partitioed ito five atichais {1}, {2, 3, 5, 7, 11, 13, 17, 19}, {4, 6, 9, 10, 14, 15}, {8, 12, 18, 20}, {16} However, the size of the atichai {2, 3, 5, 7, 11, 13, 17, 19} of size 8 is ot maximal I fact, {4, 6, 7, 9, 10, 11, 13, 15, 17, 19} is a atichai of size 10 The set X ca be partitioed ito te chais {1, 2, 4, 8, 16}, {3, 6, 12}, {5, 10, 20}, {7, 14}, {9, 18}, {11}, {13}, {15} {17}, {19} This meas that {4, 6, 7, 9, 10, 11, 13, 15, 17, 19} is a atichai of maximal size Example 73 Let X {(i, j Z 2 : 0 i, j 3, } be a poset whose partial order is defied by (i, j (, l if ad oly if i ad j l The size of the logest chai is 7 For istace, (0, 0 < (1, 0 < (1, 1 < (1, 2 < (2, 2 < (2, 3 < (3, 3 is a chai of legth 7 The the followig collectio of subsets {(0, 0}, {(1, 0, (0, 1}, {(2, 0, (1, 1, (0, 2}, {(3, 0, (2, 1, (1, 2, (0, 3}, {(3, 1, (2, 2, (1, 3}, {(3, 2, (2, 3}, {(3, 3} is a atichai partitio of X The maximal size of atichai is 4 ad the poset X ca be partitioed ito 4 disjoit chais: (0, 0 < (0, 1 < (0, 2 < (0, 3 < (1, 3 < (2, 3 < (3, 3, (1, 0 < (1, 1 < (1, 2 < (2, 2 < (3, 2, (2, 0 < (2, 1 < (3, 1, (3, 0 {(0, 0, (0, 1, (0, 2, (0, 3, (1, 3, (2, 3, (3, 3}, {(1, 0, (1, 1, (1, 2, (2, 2, (3, 2}, {(2, 0, (2, 1, (3, 1}, {(3, 0} 11

12 The Hasse diagram of the poset X is (3, 3 (3, 2 (2, 3 (3, 1 (2, 2 (1, 3 (3, 0 (2, 1 (1, 2 (0, 3 (2, 0 (1, 1 (0, 2 (1, 0 (0, 1 (0, 0 Fidig a atichai of maximal size for a poset is a difficult problem So far there is o caoical way to do this job 12

Homework 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

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of

More information

Math 155 (Lecture 3)

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

Introduction To Discrete Mathematics

Introduction 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 information

4 The Sperner property.

4 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 information

# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf.

# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf. Combiatorics Graph Theory Coutig labelled ad ulabelled graphs There are 2 ( 2) labelled graphs of order. The ulabelled graphs of order correspod to orbits of the actio of S o the set of labelled graphs.

More information

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:

Chapter 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 information

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

MATH 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 information

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

Lecture 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 information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences 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 information

A 2nTH ORDER LINEAR DIFFERENCE EQUATION

A 2nTH ORDER LINEAR DIFFERENCE EQUATION A 2TH ORDER LINEAR DIFFERENCE EQUATION Doug Aderso Departmet of Mathematics ad Computer Sciece, Cocordia College Moorhead, MN 56562, USA ABSTRACT: We give a formulatio of geeralized zeros ad (, )-discojugacy

More information

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

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,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

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

Homework 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 information

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?

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? 2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a

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

(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 information

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

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

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.

(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 information

On the Linear Complexity of Feedback Registers

On the Linear Complexity of Feedback Registers O the Liear Complexity of Feedback Registers A. H. Cha M. Goresky A. Klapper Northeaster Uiversity Abstract I this paper, we study sequeces geerated by arbitrary feedback registers (ot ecessarily feedback

More information

The Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.

The Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size. Lecture 7: Measure ad Category The Borel hierarchy classifies subsets of the reals by their topological complexity. Aother approach is to classify them by size. Filters ad Ideals The most commo measure

More information

Largest families without an r-fork

Largest families without an r-fork Largest families without a r-for Aalisa De Bois Uiversity of Salero Salero, Italy debois@math.it Gyula O.H. Katoa Réyi Istitute Budapest, Hugary ohatoa@reyi.hu Itroductio Let [] = {,,..., } be a fiite

More information

Discrete mathematics , Fall Instructor: prof. János Pach. 1 Counting problems and the inclusion-exclusion principle

Discrete mathematics , Fall Instructor: prof. János Pach. 1 Counting problems and the inclusion-exclusion principle Discrete mathematics 014-015, Fall Istructor: prof Jáos Pach - covered material - Special thaks to Jaa Cslovjecsek, Kelly Fakhauser, ad Sloboda Krstic for sharig their lecture otes If you otice ay errors,

More information

Lecture 10: Mathematical Preliminaries

Lecture 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 information

Zeros of Polynomials

Zeros 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 information

Different kinds of Mathematical Induction

Different kinds of Mathematical Induction Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}

More information

CALCULATION OF FIBONACCI VECTORS

CALCULATION 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 information

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Randomized 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 information

Bertrand s Postulate

Bertrand 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 information

The Boolean Ring of Intervals

The Boolean Ring of Intervals MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 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

(k) x n. n! tk = x a. (i) x p p! ti ) ( q 0. i 0. k A (i) n p

(k) x n. n! tk = x a. (i) x p p! ti ) ( q 0. i 0. k A (i) n p Math 880 Bigraded Classes & Stirlig Cycle Numbers Fall 206 Bigraded classes. Followig Flajolet-Sedgewic Ch. III, we defie a bigraded class A to be a set of combiatorial objects a A with two measures of

More information

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

Homework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger. Homewor 1 Solutios Math 171, Sprig 2010 Hery Adams The exercises are from Foudatios of Mathematical Aalysis by Richard Johsobaugh ad W.E. Pfaffeberger. 2.2. Let h : X Y, g : Y Z, ad f : Z W. Prove that

More information

Math 475, Problem Set #12: Answers

Math 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 information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE 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 information

Infinite Sequences and Series

Infinite 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 information

Course : Algebraic Combinatorics

Course : Algebraic Combinatorics Course 18.312: Algebraic Combiatorics Lecture Notes # 18-19 Addedum by Gregg Musier March 18th - 20th, 2009 The followig material ca be foud i a umber of sources, icludig Sectios 7.3 7.5, 7.7, 7.10 7.11,

More information

Lecture 2. The Lovász Local Lemma

Lecture 2. The Lovász Local Lemma Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio

More information

Disjoint Systems. Abstract

Disjoint Systems. Abstract Disjoit Systems Noga Alo ad Bey Sudaov Departmet of Mathematics Raymod ad Beverly Sacler Faculty of Exact Scieces Tel Aviv Uiversity, Tel Aviv, Israel Abstract A disjoit system of type (,,, ) is a collectio

More information

1. By using truth tables prove that, for all statements P and Q, the statement

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

Chapter 0. Review of set theory. 0.1 Sets

Chapter 0. Review of set theory. 0.1 Sets Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.

More information

Axioms of Measure Theory

Axioms 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 information

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials

3.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 information

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios

More information

On the distribution of coefficients of powers of positive polynomials

On the distribution of coefficients of powers of positive polynomials AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 49 (2011), Pages 239 243 O the distributio of coefficiets of powers of positive polyomials László Major Istitute of Mathematics Tampere Uiversity of Techology

More information

MA131 - Analysis 1. Workbook 3 Sequences II

MA131 - 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 information

MATH 304: MIDTERM EXAM SOLUTIONS

MATH 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 information

Lecture 23: Minimal sufficiency

Lecture 23: Minimal sufficiency Lecture 23: Miimal sufficiecy Maximal reductio without loss of iformatio There are may sufficiet statistics for a give problem. I fact, X (the whole data set) is sufficiet. If T is a sufficiet statistic

More information

Linear chord diagrams with long chords

Linear chord diagrams with long chords Liear chord diagrams with log chords Everett Sulliva Departmet of Mathematics Dartmouth College Haover New Hampshire, U.S.A. everett..sulliva@dartmouth.edu Submitted: Feb 7, 2017; Accepted: Oct 7, 2017;

More information

Lecture Notes for Analysis Class

Lecture Notes for Analysis Class Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios

More information

INEQUALITIES BJORN POONEN

INEQUALITIES BJORN POONEN INEQUALITIES BJORN POONEN 1 The AM-GM iequality The most basic arithmetic mea-geometric mea (AM-GM) iequality states simply that if x ad y are oegative real umbers, the (x + y)/2 xy, with equality if ad

More information

TEACHER CERTIFICATION STUDY GUIDE

TEACHER CERTIFICATION STUDY GUIDE COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra

More information

Section 5.1 The Basics of Counting

Section 5.1 The Basics of Counting 1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of

More information

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x

More information

Review Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =

Review Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = = Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:

More information

Complex Numbers Solutions

Complex 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 information

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient

Problem 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 information

The multiplicative structure of finite field and a construction of LRC

The multiplicative structure of finite field and a construction of LRC IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio

More information

2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.

2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F. CHAPTER 2 The Real Numbers 2.. The Algebraic ad Order Properties of R Defiitio. A biary operatio o a set F is a fuctio B : F F! F. For the biary operatios of + ad, we replace B(a, b) by a + b ad a b, respectively.

More information

PUTNAM TRAINING INEQUALITIES

PUTNAM TRAINING INEQUALITIES PUTNAM TRAINING INEQUALITIES (Last updated: December, 207) Remark This is a list of exercises o iequalities Miguel A Lerma Exercises If a, b, c > 0, prove that (a 2 b + b 2 c + c 2 a)(ab 2 + bc 2 + ca

More information

Large holes in quasi-random graphs

Large holes in quasi-random graphs Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,

More information

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples

An 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 information

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.

and 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 information

Chain conditions. 1. Artinian and noetherian modules. ALGBOOK CHAINS 1.1

Chain conditions. 1. Artinian and noetherian modules. ALGBOOK CHAINS 1.1 CHAINS 1.1 Chai coditios 1. Artiia ad oetheria modules. (1.1) Defiitio. Let A be a rig ad M a A-module. The module M is oetheria if every ascedig chai!!m 1 M 2 of submodules M of M is stable, that is,

More information

CHAPTER 5 SOME MINIMAX AND SADDLE POINT THEOREMS

CHAPTER 5 SOME MINIMAX AND SADDLE POINT THEOREMS CHAPTR 5 SOM MINIMA AND SADDL POINT THORMS 5. INTRODUCTION Fied poit theorems provide importat tools i game theory which are used to prove the equilibrium ad eistece theorems. For istace, the fied poit

More information

USA Mathematical Talent Search Round 3 Solutions Year 27 Academic Year

USA 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 information

Sequences and Series

Sequences and Series Sequeces ad Series Sequeces of real umbers. Real umber system We are familiar with atural umbers ad to some extet the ratioal umbers. While fidig roots of algebraic equatios we see that ratioal umbers

More information

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory 1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.

More information

Theorem 3. A subset S of a topological space X is compact if and only if every open cover of S by open sets in X has a finite subcover.

Theorem 3. A subset S of a topological space X is compact if and only if every open cover of S by open sets in X has a finite subcover. Compactess Defiitio 1. A cover or a coverig of a topological space X is a family C of subsets of X whose uio is X. A subcover of a cover C is a subfamily of C which is a cover of X. A ope cover of X is

More information

REVIEW FOR CHAPTER 1

REVIEW 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 information

b i u x i U a i j u x i u x j

b i u x i U a i j u x i u x j M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here

More information

62. 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 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 information

Math 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix

Math 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix Math 778S Spectral Graph Theory Hadout #3: Eigevalues of Adjacecy Matrix The Cartesia product (deoted by G H) of two simple graphs G ad H has the vertex-set V (G) V (H). For ay u, v V (G) ad x, y V (H),

More information

MATH 205 HOMEWORK #2 OFFICIAL SOLUTION. (f + g)(x) = f(x) + g(x) = f( x) g( x) = (f + g)( x)

MATH 205 HOMEWORK #2 OFFICIAL SOLUTION. (f + g)(x) = f(x) + g(x) = f( x) g( x) = (f + g)( x) MATH 205 HOMEWORK #2 OFFICIAL SOLUTION Problem 2: Do problems 7-9 o page 40 of Hoffma & Kuze. (7) We will prove this by cotradictio. Suppose that W 1 is ot cotaied i W 2 ad W 2 is ot cotaied i W 1. The

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 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 information

AN ALMOST LINEAR RECURRENCE. Donald E. Knuth Calif. Institute of Technology, Pasadena, Calif.

AN ALMOST LINEAR RECURRENCE. Donald E. Knuth Calif. Institute of Technology, Pasadena, Calif. AN ALMOST LINEAR RECURRENCE Doald E. Kuth Calif. Istitute of Techology, Pasadea, Calif. form A geeral liear recurrece with costat coefficiets has the U 0 = a l* U l = a 2 " ' " U r - l = a r ; u = b, u,

More information

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m? MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle

More information

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 5: SINGULARITIES.

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 5: SINGULARITIES. ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 5: SINGULARITIES. ANDREW SALCH 1. The Jacobia criterio for osigularity. You have probably oticed by ow that some poits o varieties are smooth i a sese somethig

More information

Math F215: Induction April 7, 2013

Math F215: Induction April 7, 2013 Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here

More information

Fundamental Theorem of Algebra. Yvonne Lai March 2010

Fundamental Theorem of Algebra. Yvonne Lai March 2010 Fudametal Theorem of Algebra Yvoe Lai March 010 We prove the Fudametal Theorem of Algebra: Fudametal Theorem of Algebra. Let f be a o-costat polyomial with real coefficiets. The f has at least oe complex

More information

Optimal Littlewood-Offord inequalities in groups

Optimal Littlewood-Offord inequalities in groups Optimal Littlewood-Offord iequalities i groups T. Juškevičius 1, G. Šemetulskis arxiv:1707.01085v [math.pr] Apr 018 Abstract We prove several Littlewood-Offord type iequalities for arbitrary groups. I

More information

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1 MATH 2: HOMEWORK 6 SOLUTIONS CA PRO JIRADILOK Problem. If s = 2, ad Problem : Rudi, Chapter 3, Problem 3. s + = 2 + s ( =, 2, 3,... ), prove that {s } coverges, ad that s < 2 for =, 2, 3,.... Proof. The

More information

Exercises 1 Sets and functions

Exercises 1 Sets and functions Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,

More information

Let us consider the following problem to warm up towards a more general statement.

Let 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 information

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

More information

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)

Putnam 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 information

LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK)

LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) Everythig marked by is ot required by the course syllabus I this lecture, all vector spaces is over the real umber R. All vectors i R is viewed as a colum

More information

On Random Line Segments in the Unit Square

On Random Line Segments in the Unit Square O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,

More information

1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable

More information

Chapter 1 : Combinatorial Analysis

Chapter 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 information

Beurling Integers: Part 2

Beurling 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 information

Dedicated to the memory of Lev Meshalkin.

Dedicated to the memory of Lev Meshalkin. A Meshalki Theorem for Projective Geometries Matthias Beck ad Thomas Zaslavsky 2 Departmet of Mathematical Scieces State Uiversity of New York at Bighamto Bighamto, NY, U.S.A. 3902-6000 matthias@math.bighamto.edu

More information

Induction: Solutions

Induction: 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 information

MT5821 Advanced Combinatorics

MT5821 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

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

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 M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet

More information

Lecture Notes for CS 313H, Fall 2011

Lecture 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 information

Solutions. tan 2 θ(tan 2 θ + 1) = cot6 θ,

Solutions. tan 2 θ(tan 2 θ + 1) = cot6 θ, Solutios 99. Let A ad B be two poits o a parabola with vertex V such that V A is perpedicular to V B ad θ is the agle betwee the chord V A ad the axis of the parabola. Prove that V A V B cot3 θ. Commet.

More information

Summer High School 2009 Aaron Bertram

Summer 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 information

Random Graphs and Erdős Magic Joel Spencer Asperen, October 30- November 1, 2018

Random Graphs and Erdős Magic Joel Spencer Asperen, October 30- November 1, 2018 Radom Graphs ad Erdős Magic Joel Specer Aspere, October 30- November 1, 2018 A Special Note: These otes are oly a approximatio to the actual lectures. There is some extra material here, ad there will almost

More information

Mathematical Foundations -1- Sets and Sequences. Sets and Sequences

Mathematical Foundations -1- Sets and Sequences. Sets and Sequences Mathematical Foudatios -1- Sets ad Sequeces Sets ad Sequeces Methods of proof 2 Sets ad vectors 13 Plaes ad hyperplaes 18 Liearly idepedet vectors, vector spaces 2 Covex combiatios of vectors 21 eighborhoods,

More information

Random Models. Tusheng Zhang. February 14, 2013

Random 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 information

MT5821 Advanced Combinatorics

MT5821 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 information