For every integer $k \geqslant 2$, we set $\zeta(k) = \sum_{n=1}^{+\infty} n^{-k}$. We define a sequence of real numbers $(b_n)_{n \in \mathbb{N}}$ by setting $b_0 = 1$, $b_1 = -\frac{1}{2}$, then $$\forall n \in \mathbb{N}^*, \quad b_{2n+1} = 0 \quad \text{and} \quad b_{2n} = \frac{(-1)^{n-1}(2n)!\zeta(2n)}{2^{2n-1}\pi^{2n}}$$ Using the relation $\sum_{k=0}^{n} \frac{b_k}{k!(n+1-k)!} = 0$ for $n \geqslant 1$, calculate $b_2$, $b_4$ and $b_6$, then $\zeta(2)$, $\zeta(4)$ and $\zeta(6)$.
Suppose (for this question only) that $h$ is the function $x \mapsto x$. Determine a solution of $(E_{h})$: $$\forall x \in \mathbb{K},\, f(x+1) - f(x) = x$$ in $\mathbb{K}_{2}[X]$, then all polynomial solutions of the equation $(E_{h})$.
Using the Bernoulli polynomials $(B_n)_{n \in \mathbb{N}}$ satisfying $B_n(z+1) - B_n(z) = nz^{n-1}$ for all $n \in \mathbb{N}^*$, deduce the expression of a polynomial function satisfying the equation $(E_h)$: $$\forall x \in \mathbb{C},\, f(x+1) - f(x) = h(x)$$ on $\mathbb{C}$ when $h$ is a polynomial function.
Let $G = ( S , A )$ be a graph with $| S | = n \geq 2$. We write $\chi _ { G } ( X ) = X ^ { n } + \sum _ { k = 0 } ^ { n - 1 } a _ { k } X ^ { k }$. Give the value of $a _ { n - 1 }$ and express $a _ { n - 2 }$ in terms of $| A |$.
Let $n$ be a non-zero natural integer. For any permutation $\sigma \in \mathfrak{S}_{n}$, we recall that there exists, up to order, a unique decomposition $\sigma = c_{1} c_{2} \cdots c_{\omega(\sigma)}$, where $\omega(\sigma) \in \mathbb{N}^{*}$ where $c_{1}, \ldots, c_{\omega(\sigma)}$ are cycles with disjoint supports of respective lengths $\ell_{1} \leqslant \ell_{2} \leqslant \cdots \leqslant \ell_{\omega(\sigma)}$ and $\ell_{1} + \ell_{2} + \cdots + \ell_{\omega(\sigma)} = n$. For an integer $k$ at most $n$, we denote by $s(n,k)$ the number of permutations of $\mathfrak{S}_{n}$ such that $\omega(\sigma) = k$. Show that $$\frac{1}{n!} \sum_{k=1}^{n} k(k-1) s(n,k) = \sum_{i=1}^{n} \sum_{j=1}^{n} \frac{1}{ij} - \sum_{i=1}^{n} \frac{1}{i^{2}}.$$
Let $\left(a_{n}\right)_{n \geqslant 2}$ be a sequence of real numbers. For $t \in \mathbb{R}$, we set $A(t) = \sum_{2 \leqslant k \leqslant t} a_{k}$. Let $b : [2, +\infty[ \rightarrow \mathbb{R}$ be a function of class $\mathscr{C}^{1}$. Show that for any integer $n \geqslant 2$, $$\sum_{k=2}^{n} a_{k} b(k) = A(n) b(n) - \int_{2}^{n} b^{\prime}(t) A(t) \mathrm{d}t.$$
For any non-zero natural integer $n$, we set $$\omega(n) = \operatorname{Card}\{p \text{ prime} : p \mid n\} = \sum_{\substack{p \mid n \\ p \text{ prime}}} 1.$$ Let $\left(a_n\right)_{n \geqslant 2}$ be a sequence of real numbers. For $t \in \mathbb{R}$, we set $A(t) = \sum_{2 \leqslant k \leqslant t} a_k$. Let $b : [2, +\infty[ \rightarrow \mathbb{R}$ be a function of class $\mathscr{C}^1$. Show that for any integer $n \geqslant 2$, $$\sum_{k=2}^{n} a_k b(k) = A(n)b(n) - \int_2^n b'(t) A(t) \, \mathrm{d}t$$
Let $r$ and $s$ be two strictly positive natural integers such that $r > s$, and $$J _ { r , s } = \sum _ { k = 0 } ^ { + \infty } \frac { 1 } { ( r + k + 1 ) ( s + k + 1 ) }$$ Deduce that $$J _ { r , s } = \frac { 1 } { r - s } \sum _ { k = 0 } ^ { + \infty } \left( \frac { 1 } { s + k + 1 } - \frac { 1 } { r + k + 1 } \right)$$
Let $r$ and $s$ be two strictly positive natural integers such that $r > s$, and $$J _ { r , s } = \frac { 1 } { r - s } \sum _ { k = 0 } ^ { + \infty } \left( \frac { 1 } { s + k + 1 } - \frac { 1 } { r + k + 1 } \right)$$ Deduce that $$J _ { r , s } = \frac { 1 } { r - s } \sum _ { k = s + 1 } ^ { r } \frac { 1 } { k }$$
113. We classify the natural numbers in groups such that each group contains consecutive numbers, i.e., $\ldots, \{4,5,6\}, \{2,3\}, \{1\}, \ldots$ What is the sum of the numbers in the group containing 350? $$4125 \quad (1) \qquad 4050 \quad (2) \qquad 4015 \quad (3) \qquad 3980 \quad (4)$$