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.
Answer
Answers can be viewed only if
- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.
1 Attachment
-
Leave a comment if you need any clarifications.
The answer is accepted.
- answered
- 166 views
- $7.00
Related Questions
- Logic Question (π΄→(π΅→πΆ))→((π΄→π΅)→(π΄→πΆ))
- Probability of picking a red ball
- Finding a unique structure of the domain of a function that gives a unique intuitive average?
- Logic Questions (π΄→πΆ)∧(π΅→πΆ)β’(π΄∧π΅)→πΆ
- Discrete Structures - Proving a statement true
- Markov Process Problem
- Logic Question π΄∨π΅→πΆβ’(π΄→πΆ)∧(π΅→πΆ)
- Logic Question ¬¬π΄→π΄
