On a generalization of a theorem by Euler (Q2254209): Difference between revisions

The paper establishes that, for \(k=1,2,3, \ldots ,\) \[ \sum_{n=1}^{\infty} \frac{\sin^k(nt)}{n^k} = \left ( \frac{\pi}{2} \right ) \left ( \frac{t}{2} \right )^{k-1} \frac{S_k}{(k-1)!} - \frac{t^k}{2} , \] with \(0 < t < 2 \pi\) if \(k=1\) and \(0 \leq t \leq 2 \pi /k\) if \(k \geq 2\), being \[ S_k :\!= \sum_{i=0}^{\gamma_k} (-1)^i {k \choose i} (k-2i)^{k-1} \] where \( {\gamma}_k :\!= \lfloor \frac{k-1}{2} \rfloor \). As clarified in the title, it is an extension of the 1744 result of Euler \[ \frac{\pi -t}{2} = \sum_{n=1}^{\infty} \frac{\sin(nt)}{n} = \frac{\sin(t)}{1} + \frac{\sin(2t)}{2} + \frac{\sin(3t)}{3} + \ldots \] well illustrated by \textit{P. J. Nahin} [Dr. Euler's fabulous formula. Cures many mathematical ills. Princeton, NJ: Princeton University Press (2006; Zbl 1115.00004)]. After a nice description of the historical background involving the numbers introduced by \textit{J. Bernoulli} [Wahrscheinlichkeitsrechnung (Ars conjectandi). Leipzig: W. Engelmann (1899; JFM 30.0210.01)] and their applications (see, for instance, [\textit{R. L. Graham} et al., Concrete mathematics: a foundation for computer science. 2nd ed. Amsterdam: Addison-Wesley Publishing Group (1994; Zbl 0836.00001)] and \textit{N. M. Temme} [Special functions. An introduction to the classical functions of mathematical physics. New York: J. Wiley (1996; Zbl 0856.33001)]), the Bernoulli polynomials (see Chapter 23 of \textit{M. Abramowitz} and \textit{I. A. Stegun} [Handbook of mathematical functions. New York etc.: John Wiley \& Sons (1972; Zbl 0543.33001)]) and their Fourier expansions (studied, e.g., by \textit{M. Kline } [Math. Mag. 56, No. 5, 307--314 (1983; Zbl 0526.01015)] and by \textit{L. M. Navas} et al. [J. Approx. Theory 163, No. 1, 22--40 (2011; Zbl 1253.11028)]), the author summarizes his achievement as the determination of a set of real-valued functions \(f_k(t)\) expanded, for some fixed \(t\), in the Fourier series \[ f_k(t) = \sum_{n=1}^{\infty} \frac{\sin^k(nt)}{n^k} , \] remarking how the Euler's formula is obtained when \(k=1\). The author also suggests to employ the main theorem, proved through combinatorial and trigonometric arguments, in the fields of both the stochastic processes, by inferring the probability distributions of random variables in the Riemann Brownian areas, and the infinite series with real numbers, by supplying alternative proofs for known identities and deriving new ones solved in terms of simple functions of \(\pi\) (some of which successfully computed via \texttt{Mathematica}).