grandes-ecoles 2019 Q36

grandes-ecoles · France · centrale-maths2__pc Proof Proof by Induction or Recursive Construction

Using the recurrence relation $2\beta_{n+1} = \sum_{k=0}^{n} \binom{n}{k} \beta_k \beta_{n-k}$ and the analogous relation $2\alpha_{n+1} = \sum_{k=0}^{n} \binom{n}{k} \alpha_k \alpha_{n-k}$ with $\alpha_0 = \beta_0 = 1$, deduce that $\beta_n = \alpha_n$ for every $n \in \mathbb{N}$.

Using the recurrence relation $2\beta_{n+1} = \sum_{k=0}^{n} \binom{n}{k} \beta_k \beta_{n-k}$ and the analogous relation $2\alpha_{n+1} = \sum_{k=0}^{n} \binom{n}{k} \alpha_k \alpha_{n-k}$ with $\alpha_0 = \beta_0 = 1$, deduce that $\beta_n = \alpha_n$ for every $n \in \mathbb{N}$.

Paper Questions

Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q16 Q17 Q18 Q19 Q20 Q21 Q22 Q23 Q24 Q25 Q26 Q27 Q28 Q29 Q30 Q31 Q32 Q33 Q34 Q35 Q36 Q37 Q38 Q39