Discrete Math Quiz
12 questions · no time limit
0:00
COUNTING AND COMBINATORICS
Question 1 of 12
No time limit
Current
Answered
Flagged
Not seen
The Catalan numbers CnC_n satisfy C0=1C_0 = 1 and Cn=∑i=0n−1CiCn−1−iC_n = \sum_{i=0}^{n-1} C_i C_{n-1-i} for n≥1n \geq 1. These count the number of ways to parenthesize a product of n+1n+1 factors. What is C3C_3?
YOUR PROGRESS
12
QUESTIONS
Ready when you are
Answer in any order. Your progress shows here as you go.
QUESTIONS
KEYBOARD
Pick an answer ABCD
Next question ↵→
Previous ←
Flag for review F
Answers save as you go · flagged questions come back at the end