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.
- 432 views
- [Discrete Mathematics] Algorithm and Pseudocode - Write an algorithm to find the roots of a quadratic equation ax2 + bx + c = 0. Write Pseudocode of algorithm.
- Three unbiased coins are tossed. What is the probability of getting at most two heads?
- In how many different ways $n$ persons can seat around a round table?
- A-Level Probability Counting Problem
- Find the generating function
- Logic Question ¬¬𝐴→𝐴
- Graph theory question on Euler circuit, Euler path, Hamilton circuit, and Hamilton path
- Set Theory Question Help