Exercise III: Catalan numbers For n e N, denote by c, to be the number of ways to form a "mountain range" with n upstrokes (U) and n downstrokes (D) that all stay above a horizontal line. For instance: • for n = 1, only UD is allowed, so c1 = 1; • for n = 2, only UUDD and U DUD are allowed, so c2 = 2. 1. Check that c3 = 5 by writing down or drawing all possible options. 2. Consider the power series „a" 3 = (x)6 n=0 (by definition co = 1) called the generating function of the sequence (en). Justify that Cn < 4" for each n, and deduce that the radius of convergence of g is at least 1/4.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Exercise III: Catalan numbers
For n e N, denote by c, to be the number of ways to form a "mountain range" with n
upstrokes (U) and n downstrokes (D) that all stay above a horizontal line. For instance:
for n = 1, only UD is allowed, so c = 1;
• for n = 2, only UUDD and UDUD are allowed, so c2 = 2.
1. Check that c3 = 5 by writing down or drawing all possible options.
2. Consider the power series
+00
g(x) = 2
n=0
(by definition co =
1) called the generating function of the sequence (en). Justify
that cn < 4" for each n, and deduce that the radius of convergence of g is at least
1/4.
3. It can be show that for r E (-1/4, 1/4),
g(x) = 1+ xg(r)?
and therefore
1- VI
4.x
g(x) =
2.x
Use this formula and the known power series of V1+ x to write the first terms of
the power series expansion of g, in the form
g(x) = co + c1x + c2x2 + C3x + c4x* + ·..
Show how you obtain a few terms, but you do not need to show all computations
and you can use a calculator for fractions. Check that you recover co, C1, C2, C3, and
deduce the value of c4.
4. (Bonus, ungraded, for fun) Check your result by writing down or drawing all possible
paths for n = 4.
Transcribed Image Text:Exercise III: Catalan numbers For n e N, denote by c, to be the number of ways to form a "mountain range" with n upstrokes (U) and n downstrokes (D) that all stay above a horizontal line. For instance: for n = 1, only UD is allowed, so c = 1; • for n = 2, only UUDD and UDUD are allowed, so c2 = 2. 1. Check that c3 = 5 by writing down or drawing all possible options. 2. Consider the power series +00 g(x) = 2 n=0 (by definition co = 1) called the generating function of the sequence (en). Justify that cn < 4" for each n, and deduce that the radius of convergence of g is at least 1/4. 3. It can be show that for r E (-1/4, 1/4), g(x) = 1+ xg(r)? and therefore 1- VI 4.x g(x) = 2.x Use this formula and the known power series of V1+ x to write the first terms of the power series expansion of g, in the form g(x) = co + c1x + c2x2 + C3x + c4x* + ·.. Show how you obtain a few terms, but you do not need to show all computations and you can use a calculator for fractions. Check that you recover co, C1, C2, C3, and deduce the value of c4. 4. (Bonus, ungraded, for fun) Check your result by writing down or drawing all possible paths for n = 4.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY