How many balanced lists of n left and n right parentheses are there?
A list of parentheses is said to be balanced if there are the same number of left parentheses as right, and as we count from left to right we always find at least as many left parentheses as right parentheses.
For example, (((()()))()) is balanced and ((()) and (()()))(() are not.
Question:How many balanced lists of n left and n right parentheses are there?
HINT: Find a bijection between lattice paths and lists of parentheses.
I know that my answer is going to be what is on the .PNG file, usless it it wrong.
It is subtracting the total paths - bad paths
I am just unsure the steps to get to the answer.
Lalo G
52
Answer
Answers can only be viewed under the following conditions:
- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.
1 Attachment
Erdos
4.8K
-
Leave a comment if you need any clarifications.
The answer is accepted.
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
- answered
- 840 views
- $7.00
Related Questions
- Combinatorics Questions: Card Pairs, Letter Arrangements, and Number Sequences
- Discrete Structures - Proving a statement false by proving the negation to be true
- Find the generating function
- Prove that ${n\choose 2}2^{n-2}=\sum\limits_{k=2}^{n}{n\choose k}{k\choose 2}$ for all $n\geq 2$
- Discrete Math
- Solve summation problem: $\sum_{k=1}^{n} \tfrac{2k+1}{k^{2}(k+1)^2 } $
- Proof by induction the following recursive equation
- Logic Question 𝐴∧(𝐵∨𝐶)⊢(𝐴∧𝐵)∨(𝐴∧𝐶)
