Harvard Binomial Theorem Deep Cuts & Catalan Numbers Combinatorics Paper

User Generated

xrielzne24

Mathematics

Harvard University

Description

It is typewritten. Please show the work and use equation editor for mathematical symbols and equations. Thank you 😊.

Unformatted Attachment Preview

Homework problems. You must submit all homework problems in order to receive full credit. (1) Give a combinatorial proof that for all n > 1, Σ(0) (...) - (). 12) Consider the following identity, valid for all n > 1: k(k-1) - (; 2n-An(n-1). Give an algebraic proof of this identity (that is, using the binomial theorern). 3) Prove that the Catalan numbers satisfy Co = 1 and C%+1 - ΣCC- ko for all n > 0 - [4) Determine the number of ways of properly parenthesizing the product of n +1 values. For example, if n = 3, then there are 5 ways: (ab)c)d (ab)(cd) (a(be)) albe)d) a(b(cd)) Hint: you may find it helpful to find all 14 ways to do this when n = 4. .5) A triangulation of a regular n-gon (all sides are equal length and all interior angles are equal) is a way of drawing n–3 non-crossing diagonals to form n-2 triangles. For example, the following are triangluations of a regular pentagon. 0 40 1 4 4 3 3 2 3 2 Prove that the number of triangulations of a regular n-gon equals Co-2- Hint: you may do this bijectively (by finding a bijection between the triangulations of an n- gon and the Dyck paths from (0,0) to (n-2, 1-2)), or combinatorially (using the identity in Problem (H3) and a combinatorial proof), or by direct counting argument (using the formula for Coin Problem (D2)). Challenge problems. Challenge problems are not required for submission, but bonus points will be awarded for submitting a partial attempt or a complete solution. 6. Problem (H5) gave 3 methods of completing the proof. Prove it again using 1 of the 2 methods you did not choose previously.
Purchase answer to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Explanation & Answer

CANCELLATION
I have completed the first 5 questions. Please mark my answer as complete. Thank you.

1.
Sol.

Proof
𝑛
∑𝑛𝑘=0(𝑛𝑘)(𝑛−𝑘
) = (2𝑛
)
𝑛

Consider the expression (𝑥 + 𝑦)2𝑛
The coefficient of 𝑥 𝑛 𝑦 𝑛 in the expansion can be calculated as follows
Method 1
Using the binomial theorem directly,
we get the coefficient of 𝑥 𝑛 𝑦 𝑛 in the expansion of (𝑥 + 𝑦)2𝑛 to be (2𝑛
).
𝑛
Method 2
Rewriting the expression (𝑥 + 𝑦)2𝑛 𝑎𝑠 (𝑥 + 𝑦)𝑛 (𝑥 + 𝑦)𝑛
To obtain the 𝑥 𝑛 𝑦 𝑛 in the product,
Consider the term with 𝑥 𝑘 𝑦 𝑛−𝑘 in the first expansion. It should be multiplied with corresponding term
𝑥 𝑛−𝑘 𝑦 𝑘 in the second expansion for every value of k from 0 to n
From the binomial theorem,
we know that, in the expansion of (𝑥 + 𝑦)𝑛 , the coefficient of 𝑥 𝑛−𝑘 𝑦 𝑘 will be (𝑛𝑘).
Similarly, , in the expansion of (𝑥 + 𝑦)𝑛 , the coefficient of 𝑥 𝑛−𝑘 𝑦 𝑘 will be (𝑛𝑘).
𝑛
Therefore, multiplying the corresponding coefficients, we get (𝑛𝑘)(𝑛−𝑘
) as the coefficient of 𝑥 𝑛 𝑦 𝑛 from
the term 𝑥 𝑘 𝑦 𝑛−𝑘 .

And this should be calculated for all the values of k.
Therefore, coefficient of the term 𝑥 𝑛 𝑦 𝑛 in the product (𝑥 + 𝑦)𝑛 (𝑥 + 𝑦)𝑛 can be written as the sum of
all the corresponding coefficients which give rise to the term 𝑥 𝑛 𝑦 𝑛
Therefore,
𝑛

∑ 𝐶𝑜𝑒𝑓𝑓𝑖𝑐𝑖𝑒𝑛𝑡 𝑜𝑓 𝑥 𝑛 𝑦 𝑛 𝑚𝑎𝑑𝑒 𝑏𝑦 𝑡ℎ𝑒 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑦𝑖𝑛𝑔 𝑡ℎ𝑒 𝑡𝑒𝑟𝑚 𝑤𝑖𝑡ℎ 𝑥 𝑘 𝑦 𝑛−𝑘 𝑖𝑛 𝑡ℎ𝑒 𝑓𝑖𝑟𝑠𝑡 𝑒𝑥𝑝𝑎𝑛𝑠𝑖𝑜𝑛
𝑘=0
𝑛

𝑛
𝑛
= ∑( )(
)
𝑘 𝑛−𝑘
𝑘=0

As both the methods are used to calculate the same value, we can equate both the values obtained in
Method 1 and Method 2.
𝑛

2𝑛
𝑛
𝑛
( ) = ∑ ( )(
)
𝑛
𝑘 𝑛−𝑘
𝑘=0

Hence Proved

2. Prove the identity
𝒏

𝒏
∑ 𝒌(𝒌 − 𝟏) ( ) = 𝟐𝒏−𝟐 𝒏(𝒏 − 𝟏)
𝒌

𝒌=𝟐

LHS
𝑛

𝑛...


Anonymous
Excellent! Definitely coming back for more study materials.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4

Related Tags