A class of subsums of Euler's sum (Q334533)

The first result of the paper under review is the formula: NEWLINE\[NEWLINE \sum_{\overset{n=1}{ n\equiv \pm s \text{ (mod \(m\))}}}^{\infty} \frac1{n^{2k}} = \frac{(-1)^{k-1}2^{2k}\pi^{2k}}{m(2k)!} \sum_{j=0}^{m-1} B_{2k}(j/m) \cos(2\pi sj/m), NEWLINE\]NEWLINE valid for any \(k,m\in {\mathbb N}=\{1,2,\ldots\}\), \(m\geq 3\), \(s\in {\mathbb Z}\), \(2s\not\equiv 0\) (mod \(m\)), where\(B_n(x)\) are the Bernoulli polynomials. This extends an earlier result of \textit{L. M. Navas} et al. [J. Approx. Theory 163, No. 1, 22--40 (2011; Zbl 1253.11028)], obtained for odd values of \(m\). In addition, the author offers a different simple proof.NEWLINENEWLINEThe main result is an explicit formula for sums of type NEWLINE\[NEWLINE \sum_{\overset{n=1}{ n\equiv a_1,a_2,\ldots,a_r \text{ (mod \(m\))}}}^{\infty} \frac1{n^{2k}}, NEWLINE\]NEWLINE where \(k,m,r\in {\mathbb N}\), \(m,r\geq 2\) and \(1\leq a_1<a_2<\cdots < a_r\leq m-1\) satisfy certain conditions. Several applications and examples are also discussed.