scholarly journals Shortened recurrence relations for Bernoulli numbers

2009 ◽  
Vol 309 (4) ◽  
pp. 887-898 ◽  
Author(s):  
Takashi Agoh ◽  
Karl Dilcher
Symmetry ◽  
2019 ◽  
Vol 12 (1) ◽  
pp. 9 ◽  
Author(s):  
Daeyeoul Kim ◽  
Yilmaz Simsek ◽  
Ji Suk So

The purpose of this paper is to construct generating functions for negative order Changhee numbers and polynomials. Using these generating functions with their functional equation, we prove computation formulas for combinatorial numbers and polynomials. These formulas include Euler numbers and polynomials of higher order, Stirling numbers, and negative order Changhee numbers and polynomials. We also give some properties of these numbers and polynomials with their generating functions. Moreover, we give relations among Changhee numbers and polynomials of negative order, combinatorial numbers and polynomials and Bernoulli numbers of the second kind. Finally, we give a partial derivative of an equation for generating functions for Changhee numbers and polynomials of negative order. Using these differential equations, we derive recurrence relations, differential and integral formulas for these numbers and polynomials. We also give p-adic integrals representations for negative order Changhee polynomials including Changhee numbers and Deahee numbers.


2001 ◽  
Vol 64 (3) ◽  
pp. 469-474 ◽  
Author(s):  
Ching-Hua Chang ◽  
Chung-Wei Ha

We obtain a class of recurrence relations for the Bernoulli numbers that includes a recurrence formula proved recently by M. Kaneko. Analogous formulas are also derived for the Euler and Genocchi numbers.


2014 ◽  
Vol 98 (543) ◽  
pp. 459-474 ◽  
Author(s):  
Nick Lord

The problem of finding a closed-form evaluation ofbaffled the pioneers of calculus such as Leibniz and James Bernoulli and, following the latter’s promulgation of the problem, it became known as the Basel problem after his home town (which was also Euler’s birthplace). Euler’s early sensational success in solving the Basel problem by identifyingis extremely well-documented. In this paper, we give the full details of his subsequent derivation of the general formulawhere (Bn) is a sequence of ‘strange constants’. Euler’s polished account of his discovery, in which he popularised the designation of the strange constants as ‘Bernoulli numbers’, appears in Chapter 5 of Volume 2 of his great textbookInstitutiones calculi differentialis[1; E212]: see [2] for an online English translation. Here, we will focus on his initial step-by-step account which appeared in his paper with Eneström number E130, written c1739, carrying the rather nondescript titleDe seriebus quibusdam considerationes, ‘Considerations about certain series’. (For convenience, we will just use ‘Eneström numbers’ when referencing Euler’s work: all are readily available on-line at [1].) Euler’s proof is notable for its early, sophisticated and incisive use of generating functions and for his brilliant insight that the sequence (Bn) occurring in the coefficients of the general ζ(2n) formula (1) also occurs in the Euler-Maclaurin summation formula and in the Maclaurin expansion of. By retracing Euler’s original path, we shall not only be able to admire the master in full creative flow, but also appreciate the role played by recurrence relations such aswhich, as our ample list of references (which will be reviewed later) suggests, have been rediscovered over and over again in the literature. Moreover, our historical approach makes it clear that, while deriving (2) is relatively straightforward (and may be used to calculate ζ(2n) recursively as a rational multiple of ζ2n), it is establishing the connection between ζ(2n) and the Bernoulli numbers that was for Euler the more difficult step. Even today, this step presents pedagogical challenges depending on one’s starting definition for the Bernoulli numbers and what identities satisfied by them one is prepared to assume or derive.


2019 ◽  
Vol 15 (10) ◽  
pp. 2043-2055
Author(s):  
Aimin Xu

The generalized Somos recurrence is defined by [Formula: see text] In the present paper, for fixed [Formula: see text], we study the following asymptotic series [Formula: see text] as [Formula: see text]. By using the Bell polynomials and the cycle indicator polynomials of the symmetric group, recurrence relations and a general explicit expression for the coefficients [Formula: see text] are developed. It is also shown that these coefficients are closely related to the Apostol–Bernoulli numbers. Furthermore, an asymptotic estimation for the coefficients [Formula: see text] is given as [Formula: see text].


10.37236/657 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Yan-Ping Mu

For a sum of the form $\sum_k F({\boldsymbol n},k)G({\boldsymbol n},k)$, we set up two systems of equations involving shifts of $F({\boldsymbol n},k)$ and $G({\boldsymbol n},k)$. Then we solve the systems by utilizing the recursion of $F({\boldsymbol n},k)$ and the method of undetermined coefficients. From the solutions, we derive linear recurrence relations for the sum. With this method, we prove many identities involving Bernoulli numbers and Stirling numbers.


2018 ◽  
Vol 11 (3) ◽  
pp. 29-39
Author(s):  
E. I. Jafarov ◽  
A. M. Jafarova ◽  
S. M. Nagiyev

Author(s):  
Georgiy Aleksandrovich Popov

The article deals with a two-channel queuing system with a Poisson incoming call flow, in which the application processing time on each of the devices is different. Such models are used, in particular, when describing the operation of the system for selecting service requests in a number of operating systems. A complex system characteristic was introduced at the time of service endings on at least one of the devices, including the queue length, the remaining service time on the occupied device, and the time since the beginning of the current period of employment. This characteristic determines the state of the system at any time. Recurrence relations are obtained that connect this characteristic with its marginal values when there is no queue in the system. The method of introducing additional events was chosen as one of the main methods for analyzing the model. The relationships presented in this article can be used for analysis of the average characteristics of this system, as well as in the process of its simulation. Summarizing the results of work on multichannel systems with an arbitrary number of servicing devices will significantly reduce the time required for simulating complex systems described by sets of multichannel queuing systems.


Sign in / Sign up

Export Citation Format

Share Document