maths.free › Combinatorics & Graph Theory › Strings, Sets, and Binomial Coefficients › An Activity on Lattice Paths, the Binomial Theorem, and the Multinomial Theorem
An Activity on Lattice Paths, the Binomial Theorem, and the Multinomial Theorem
Before considering the proof about the number of lattice paths from (0,0) to (n,n) that do not go above the diagonal y=x in , let's practice counting some lattice paths with some restrictions.
An Activity on Lattice Paths, the Binomial Theorem, and the Multinomial Theorem
Before considering the proof about the number of lattice paths from \((0,0)\) to \((n,n)\) that do not go above the diagonal \(y=x\) in , let's practice counting some lattice paths with some restrictions.
You will not be tested on the proof in , but you are expected to know that the number of lattice paths from \((0,0)\) to \((n,n)\) that do not go above the diagonal \(y=x\) is counted by the Catalan numbers \[\begin{aligned}\end{aligned}\]. We will see the Catalan numbers come up a number times through the remainder of our course, including quite likely on the very last day of the semester! There are a couple of important methods that come up in the proof that we will use often, and I do want to highlight those:
Sometimes it appears hard to directly count the objects of interest (the so-called good lattice paths), but it is still reasonable to count all the objects in a larger set (all lattice paths from \((0,0)\) to \((n,n)\)) and then subtract off those we don't want to count (the bad lattice paths).
Sometimes on the surface, it is difficult to count the objects of interest (the bad lattice paths) but we can transform them in an invertible way to a collection of objects that is easier to count.
I do think that it's worthwhile spending some time understanding how we define bad lattice path and the transformation in the text, here are a couple of questions on the subject:
Let's now turn to some questions involving use of the binomial and multinomial theorem.
One of the interesting things about understanding the is figuring out how many terms are even in the summation, since the notation involves a summation that you might not be familiar with. The notation \(\displaystyle \sum_{k_1+k_2+\cdots+k_r=n}\) means that we sum over all nonnegative (i.e., greater than or equal to 0) integers \(k_1,k_2,\dots,k_r\) so that the sum \(k_1+k_2 + \cdots + k_r\) is exactly \(n\).
To help you check yourself on the class prep assignment, the answer to the question that asked for the coefficient on \(x^{30}y^{80}z^{10}\) in \((2x^{3}+y-z^{2})^{100}\) must be \(0\) because such a term cannot arise. Such a term would need an exponent of 5 on \(-z^2\) and an exponent of 10 on \(2x^3\). The sum of the exponents would need to be 100, so this leaves 85 as the exponent on \(y\). However, the term inquired about has \(y^{80}\).
Tani ti. Asnjë kalkulator nuk e zgjidh këtë, por pjesët e saj janë të llogaritura. Provo një më poshtë, ose shkruaj tënde.
Praktiko (7)
Provo secilin në letër së pari. Zbulo përgjigjen për të kontrolluar; ato të verifikuara mund të hapen në zgjidhës për çdo hap.
-
The bad lattice path \(HHVVHVVHHVVH\) from \((0,0)\) to \((6,6)\) goes bad (crosses the diagonal) at position
-
The bad lattice path \(HHVVHVVHHVVH\) from \((0,0)\) to \((6,6)\) is transformed to which of the following lattice paths from \((0,0)\) to \((5,7)\)?
-
The coefficient on \(x^{7}y^{13}\) in the expansion of \((2x-4y)^{20}\) is
-
How many rearrangements of the string APPLIEDCOMBINATORICSISTHEMOSTINTERESTINGBOOKEVER are there if all letters must be used? (Note that there are a couple of hints outside the blue box on Runestone!)
Zbulo përgjigjen
Hint:
The length of string is 48 characters.
-
How many (different) terms are there in the expansion of \((x+y+z+w)^{17}\)?
-
What is the coefficient on \(x^{3}y^{15}z^{8}\) in the expansion of \((x + 3y + 2z^{2})^{22}\)?
-
Consider the expansion of \((3+x^{5}+y+xy^{3})^{50}\). Find the coefficient on each of the following terms.
\(x^{30}y^{4}\)
\(x^{3}y^{3}\)
\(x^{30}y^{15}\)
Një llogari e lirë shtohet shënime në çdo mësim, një regjistrim të asaj që ju keni përfunduar, problemet tuaja të zgjidhura në një vend, dhe një mësues që ju mund të pyesni rreth kësaj faqeje. Matematika vetë është e hapur për të gjithë, të regjistruar apo jo.
Regjistrohu HyrSimbolet e përdorura këtu
Prek çdo simbol për përkufizimin e plotë, një fotografi dhe se çfarë do të thotë çdo shkronjë në të.
Pyetja që bëjnë njerëzit
Permutation or combination?
Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).
What is a graph in this sense?
Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.
Pjesa e kësaj faqeje është adaptuar nga Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). E përmbledhur dhe ri-shkruar këtu; gabimet janë tona.
Më shumë në Combinatorics & Graph Theory
The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs