相关论文: An efficient algorithm for the computation of Bern…

The aim of this article is to generalize in several variables some formulae for Eisenstein series in one variable. For example the formula $2\zeta(2k) = (2\pi)^{2k} \frac{B_{2k}}{(2k)!} = Res_{z=0}(\frac{1}{z^{2k}(1-e^z)})$ for the values…

In \cite{TallaWaffo2025arxiv2511.02843} we introduced even polynomials $\Xi_n,\Lambda_n\in\mathbb{Q}[x]$ arising from integral representations of $\beta(2n)/\pi^{2n-1}$ and $\zeta(2n+1)/\pi^{2n}$. In this paper we give explicit closed…

One solution to a relatively recent American Mathematical Monthly problem [6], requesting the evaluation of a real definite integral, could be couched in terms of a contour integral which vanishes {\textit{a priori.}} While the required…

In our recent publication we have proposed a new methodology for determination of the two-term Machin-like formula for pi with small arguments of the arctangent function of kind $$ \frac{\pi }{4} = {2^{k - 1}}\arctan \left(…

An algorithm for computing /pi(N) is presented.It is shown that using a symmetry of natural numbers we can easily compute /pi(N).This method relies on the fact that counting the number of odd composites not exceeding N suffices to calculate…

Because of its relation to the distribution of prime numbers, the Riemann zeta function {\zeta} (s) is one of the most important functions in mathematics. The zeta function is defined by the following formula for any complex number s with…

(This is only a first preliminary version, any suggestions about it will be welcome.) In this paper it is shown how to compute Riemann's zeta function $\zeta(s)$ (and Riemann-Siegel $Z(t)$) at any point $s\in\mathbf C$ with a prescribed…

Various new identities, recurrence relations, integral representations, connection and explicit formulas are established for the Bernoulli, Euler numbers and the values of Riemann's zeta function. To do this, we explore properties of some…

An iterative randomness extraction algorithm which generalized the Von Neumann's extraction algorithm is detailed, analyzed and implemented in standard C++. Given a sequence of independently and identically distributed biased Bernoulli…

We describe a method to accelerate the numerical computation of the coefficients of the polynomials $P_k(x)$ that appear in the conjectured asymptotics of the $2k$-th moment of the Riemann zeta function. We carried out our method to compute…

In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k_{0}, using the values of the zeta function \zeta_{k_{0}} at negative integers as our ``higher…

In this paper, we develop efficient and accurate algorithms for evaluating $\varphi(A)$ and $\varphi(A)b$, where $A$ is an $N\times N$ matrix, $b$ is an $N$ dimensional vector and $\varphi$ is the function defined by…

A real number is called simply normal to base $b$ if its base-$b$ expansion has each digit appearing with average frequency tending to $1/b$. In this article, we discover a relation between the frequency that the digit $1$ appears in the…

By using Fubini theorem or Tonelli theorem, we find that the zeta function value at 2 is equal to a special integral. Furthermore, We find that this special integral is two times of another special integral. By using this fact we obtain the…

We present another expression to regularize the Euler product representation of the Riemann zeta function. % in this paper. The expression itself is essentially same as the usual Euler product that is the infinite product, but we define a…

We provide rapidly converging formulae for the Riemann zeta function at odd integers using the Lambert series $\mathscr{L}_q(s) = \sum_{n=1}^\infty n^{s} q^{n}/(1-q^n)$, $s=-(4k\pm 1)$. Our main formula for $\zeta(4k-1)$ converges at rate…

In this paper we describe a singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. Singly exponential algorithms for computing the zero-th Betti number, and the Euler-Poincar\'e characteristic, were…

We derive new results about properties of the Witten zeta function associated with the group SU(3), and use them to prove an asymptotic formula for the number of n-dimensional representations of SU(3) counted up to equivalence. Our analysis…

We propose a new practical algorithm for computing the Feigenbaum constants {\alpha} and {\delta}, having significantly lower time and space complexity than previously used methods. The algorithm builds upon well-known linear algebra…

Let $M(n)$ denote the number of distinct entries in the $n \times n$ multiplication table. The function $M(n)$ has been studied by Erd\H{o}s, Tenenbaum, Ford, and others, but the asymptotic behaviour of $M(n)$ as $n \to \infty$ is not known…