Delange, Hubert On the real zeros of Bernoulli polynomials. (Sur les zéros réels des polynômes de Bernoulli.) (French) Zbl 0725.11011 Ann. Inst. Fourier 41, No. 2, 267-310 (1991). Nous donnons les démonstrations détaillées des résultats énoncés dans une note de même titre [C. R. Acad. Sci., Paris, Sér. I 303, 539–542 (1986; Zbl 0607.10006)]. Ces résultats concernent le nombre et la position des zéros réels des polynômes de Bernoulli. Reviewer: Hubert Delange (Orsay) Cited in 1 ReviewCited in 5 Documents MSC: 11B68 Bernoulli and Euler numbers and polynomials 12D10 Polynomials in real and complex fields: location of zeros (algebraic theorems) Keywords:Bernoulli polynomials; real zeros; upper and lower bounds; asymptotic formula Citations:Zbl 0607.10006 PDFBibTeX XMLCite \textit{H. Delange}, Ann. Inst. Fourier 41, No. 2, 267--310 (1991; Zbl 0725.11011) Full Text: DOI Numdam EuDML Digital Library of Mathematical Functions: §24.12(i) Bernoulli Polynomials: Real Zeros ‣ §24.12 Zeros ‣ Properties ‣ Chapter 24 Bernoulli and Euler Polynomials References: [1] J. BRILLHART, On the Euler and Bernoulli polynomials, J. Reine Angew. Math., 234 (1969), 45-64. · Zbl 0167.35401 [2] H. DELANGE, Sur les zéros réels des polynômes de Bernoulli, C.R. Acad. Sc. Paris, série I, 303 (1986), 539-542. · Zbl 0607.10006 [3] K. INKERI, The real roots of Bernoulli polynomials, Ann. Univ. Turk., Ser. AI, 37 (1959), 3-19. · Zbl 0104.01502 [4] D. H. LEHMER, On the maxima and minima of Bernoulli polynomials, Amer. Math. Monthly, 47 (1940), 533-538. · JFM 66.0319.04 [5] J. LENSE, Über die Nullstellen der Bernoullischen Polynome, Monatsh. Math., 41 (1934), 188-190. · JFM 60.0296.01 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.