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
- 1477 views
- $7.00
Related Questions
- Combinatorics/counting: How many configurations are possible for m differenct objects in n boxes of unlimited occupany (m<n)
- [Discrete Mathematics] For {1,3,6,10,15,…}. Find a recursive formula.
- Find 10 distinct positive integers such that each of them divides the sum of these 10 integers
- Finding a unique structure of the domain of a function that gives a unique intuitive average?
- Singular Value Decomposition Example
- Discrete Math
- Count the number of decks of cards, where no king is on top of the ace of the same suit.
- Proof by induction the following recursive equation
