中文
相关论文

相关论文: A formula for the $n^{\rm th}$ decimal digit or bi…

200 篇论文

New series representations for odd powers of {\pi} i.e. {\pi}, {\pi}3 and {\pi}5 in terms of Euler numbers and even powers of {\pi} i.e. {\pi}2, {\pi}4 and {\pi}6 in terms of Bernoulli numbers have been obtained empirically.

综合数学 · 数学 2017-10-12 H C Gupta

In this work, we consider the properties of the two-term Machin-like formula and develop an algorithm for computing digits of $\pi$ by using its rational approximation. In this approximation, both terms are constructed by using a…

A method for computing the n'th decimal digit of pi in O(n^3 log(n)^3) time and with very little memory is presented here. The computation is based on the recently discovered Bailey-Borwein-Plouffe algorithm and the use of a new algorithm…

数论 · 数学 2009-12-03 Simon Plouffe

This article gives a direct formula for the computation of B(n) using the asymptotic formula $$B (n) \approx 2 {\frac {n!}{{\pi}^{n}{2}^{n}}}$$ where n is even and $n >> 1$. This is simply based on the fact that $\zeta (n)$ is very near 1…

数论 · 数学 2007-05-23 Greg Fee , Simon Plouffe

This paper is a study of power series, where the coefficients are binomial expressions (iterated finite differences). Our results can be used for series summation, for series transformation, or for asymptotic expansions involving Stirling…

数论 · 数学 2016-10-10 Khristo N. Boyadzhiev

We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.

数论 · 数学 2017-10-16 Andrei K. Svinin , Svetlana V. Svinina

In this work, the authors provide closed forms and recurrence expressions for computing the $k$th power of the formal power series, some of them in terms of a determinant of some matrices. As a consequence, we obtain the reciprocal of the…

数论 · 数学 2023-05-11 Said Zriaa , Mohammed Mouçouf

In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…

数论 · 数学 2018-02-02 Giuseppe Fera , Vittorino Talamini

This is a collection of definitions, notations and proofs for the Bernoulli numbers $B_n$ appearing in formulas for the sum of integer powers, some of which can be found scattered in the large related historical literature in French,…

历史与综述 · 数学 2019-01-15 Jacques Gélinas

The problem of finding formulas for sums of powers of natural numbers has been of interest to mathematicians for many centuries. Among these is Faulhaber's well-known formula expressing the power sums as polynomials whose coefficients…

历史与综述 · 数学 2018-01-24 Nicholas J. Newsome , Maria S. Nogin , Adnan H. Sabuwala

In this paper, we propose a new primality test, and then we employ this test to find a formula for {\pi} that computes the number of primes within any interval. We finally propose a new formula that computes the nth prime number as well as…

数论 · 数学 2012-04-19 Issam Kaddoura , Samih Abdul-Nabi

For finite sums of non-negative powers of arithmetic progressions the generating functions (ordinary and exponential ones) for given powers are computed. This leads to a two parameter generalization of Stirling and Eulerian numbers. A…

数论 · 数学 2017-07-17 Wolfdieter Lang

By using Beta Dirichlet series and then Eisenstein series we ca represent primes with first a good approximation and an exact expression. This can be done with arbitrary prime (up to 10^101).

数论 · 数学 2023-05-17 Simon Plouffe

In this brief note, we give two explicit formulas for the Bernoulli Numbers in terms of the Stirling numbers of the second kind, and the Eulerian Numbers. To the best of our knowledge, these formulas are new. We also derive two more…

综合数学 · 数学 2020-03-09 Sumit Kumar Jha

The decimal digits of $\pi$ are widely believed to behave like as statistically independent random variables taking the values $0, 1, 2, 3, 4, 5$, $6, 7, 8, 9$ with equal probabilities $1/10$. In this article, first, another similar…

数论 · 数学 2014-11-17 Karlis Podnieks

In our previous publication we have shown a method for calculating series of even powers of $\pi$ based on the product representation of the $sinc$ function. We refer the readers to [1] for more details. In this work we apply the method to…

综合数学 · 数学 2025-03-17 Alois Schiessl

The partial fraction expansion of coth($\pi$z), due to Euler, is generalized to power series having for coefficients the Riemann zeta function evaluated at certain arithmetic sequences. A further generalization using arbitrary Dirichlet…

复变函数 · 数学 2015-11-17 Claude Henri Picard

We introduce a series of numbers which serve as a generalization of Bernoulli, Euler numbers and binomial coefficients. Their properties are applied to solve a probability problem and suggest a statistical test for independence and…

组合数学 · 数学 2013-05-09 Andrey Sarantsev

We provide direct elementary proofs of several explicit expressions for Bernoulli numbers and Bernoulli polynomials. As a byproduct of our method of proof, we provide natural definitions for generalized Bernoulli numbers and polynomials of…

数论 · 数学 2012-05-04 Lazhar Fekih-Ahmed

The purpose of this paper is to present series expansions for even powers of the number $\pi$. This is accomplished by generalizing Euler's method for solving the Basel Problem, which was published in 1735. We employ elementary symmetric…

综合数学 · 数学 2024-03-18 Alois Schiessl
‹ 上一页 1 2 3 10 下一页 ›