[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.4134/BKMS.b180347

ON LACUNARY RECURRENCES WITH GAPS OF LENGTH FOUR AND EIGHT FOR THE BERNOULLI NUMBERS

Merca, Mircea (Academy of Romanian Scientists)

Publication Information

Bulletin of the Korean Mathematical Society / v.56, no.2, 2019 , pp. 491-499 More about this Journal

Abstract

The problem of finding fast computing methods for Bernoulli numbers has a long and interesting history. In this paper, the author provides new proofs for two lacunary recurrence relations with gaps of length four and eight for the Bernoulli numbers. These proofs invoked the fact that the nth powers of ${\pi}^2$ , ${\pi}^4$ and ${\pi}^8$ can be expressed in terms of the nth elementary symmetric functions.

Keywords

Bernoulli numbers; recurrences;

Citations & Related Records

Reference

1	J. G. F. Belinfante and I. Gessel, Problems and Solutions: Solutions of Elementary Problems: E3237, Amer. Math. Monthly 96 (1989), no. 4, 364-365. DOI
2	B. C. Berndt, Ramanujan's notebooks. Part IV, Springer-Verlag, New York, 1994.
3	M. Chellali, Acceleration de calcul de nombres de Bernoulli, J. Number Theory 28 (1988), no. 3, 347-362. DOI
4	R. Honsberger, Mathematical Gems. III, The Dolciani Mathematical Expositions, 9, Mathematical Association of America, Washington, DC, 1985.
5	F. T. Howard, Applications of a recurrence for the Bernoulli numbers, J. Number Theory 52 (1995), no. 1, 157-172. DOI
6	F. T. Howard, Formulas of Ramanujan involving Lucas numbers, Pell numbers, and Bernoulli numbers, in Applications of Fibonacci numbers, Vol. 6 (Pullman, WA, 1994), 257-270, Kluwer Acad. Publ., Dordrecht, 1996.
7	F. T. Howard, A general lacunary recurrence formula, in Applications of Fibonacci numbers. Vol. 9, 121-135, Kluwer Acad. Publ., Dordrecht, 2004.
8	K. F. Ireland and M. I. Rosen, A Classical Introduction to Modern Number Theory, revised edition of Elements of number theory, Graduate Texts in Mathematics, 84, Springer-Verlag, New York, 1982.
9	D. H. Lehmer, Lacunary recurrence formulas for the numbers of Bernoulli and Euler, Ann. of Math. (2) 36 (1935), no. 3, 637-649. DOI
10	M. Merca, Asymptotics of the Chebyshev-Stirling numbers of the first kind, Integral Transforms Spec. Funct. 27 (2016), no. 4, 259-267. DOI
11	M. Merca, On families of linear recurrence relations for the special values of the Riemann zeta function, J. Number Theory 170 (2017), 55-65. DOI
12	M. Merca, Two algorithms for computing the Riemann zeta functions ${\zeta}$ (4n) and ${\zeta}$ (8n) as a reduced fraction, submitted to publication.
13	V. Namias, A simple derivation of Stirling's asymptotic series, Amer. Math. Monthly 93 (1986), no. 1, 25-29. DOI
14	S. Ramanujan, Some properties of Bernoulli's numbers, J. Indian Math. Soc. 3 (1911), 219-234.
15	C. C. Yalavigi, Bernoulli and Lucas numbers, Math. Education 5 (1971), A99-A102.
16	J. Riordan, Combinatorial Identities, John Wiley & Sons, Inc., New York, 1968.
17	T. Simpson, The invention of a general method for determining the sum of every 2d, 3d, 4th, or 5th, & c, term of a series, taken in order; the sum of the whole series being known, Philosophical Transactions 50 (1757-1758), 757-769, available at http://www.jstor.org/stable/105328.
18	H. Tsumura, An elementary proof of Euler's formula for ${\zeta}$ (2m), Amer. Math. Monthly 111 (2004), no. 5, 430-431. DOI