grandes-ecoles 2017 QIIC

grandes-ecoles · France · centrale-maths1__pc Sequences and Series Proof of Inequalities Involving Series or Sequence Terms

We set for every integer $n \geqslant 0$, $$B _ { n } = \sum _ { k = 0 } ^ { n } S ( n , k )$$ where $S(n,k)$ denotes the number of partitions of $\llbracket 1, n \rrbracket$ into $k$ parts.
Show that the sequence $\left( \frac { B _ { n } } { n ! } \right) _ { n \in \mathbb { N } }$ is bounded by 1.

We set for every integer $n \geqslant 0$,
$$B _ { n } = \sum _ { k = 0 } ^ { n } S ( n , k )$$
where $S(n,k)$ denotes the number of partitions of $\llbracket 1, n \rrbracket$ into $k$ parts.

Show that the sequence $\left( \frac { B _ { n } } { n ! } \right) _ { n \in \mathbb { N } }$ is bounded by 1.

Paper Questions

QIA QIB QIC QID QIIA QIIB QIIC QIID QIIE QIIF QIIIA QIIIB QIIIC QIIID QIVA QIVB QIVC QVA QVB QVC QVD QVE