Related papers: A shortcut for evaluating some log integrals from …
We provide an efficient method to evaluate the generalized Stieltjes constants $\gamma_n(a)$ numerically to arbitrary accuracy for large $n$ and $n \gg |a|$ values. The method uses an integral representation for the constants and evaluates…
Techniques are proposed for solving integral equations of the first kind with an input known not precisely. The requirement that the solution sought for includes a given number of maxima and minima is imposed. It is shown that when the…
We describe a method of integration to obtain identities of the arctangent function and show how this method can be applied to the high-accuracy computation of the constant pi using the equation $\pi = 4 \arctan \left( 1 \right)$. Our…
We propose a method for computing numerically integrals defined via $i \epsilon$ deformations acting on single-pole singularities. We achieve this without an explicit analytic contour deformation. Our solution is then used to produce…
In 2007, A.I.Aptekarev and his collaborators discovered a sequence of rational approximations to Euler's constant $\gamma$ defined by a linear recurrence. In this paper, we generalize this result and present an explicit construction of…
We define the indefinite logarithm [log x] of a real number x>0 to be a mathematical object representing the abstract concept of the logarithm of x with an indeterminate base (i.e., not specifically e, 10, 2, or any fixed number). The…
Prime number theorem asserts that (at large $x$) the prime counting function $\pi(x)$ is approximately the logarithmic integral $\mbox{li}(x)$. In the intermediate range, Riemann prime counting function $\mbox{Ri}^{(N)}(x)=\sum_{n=1}^N…
While the definition of a fractional integral may be codified by Riemann and Liouville, an agreed-upon fractional derivative has eluded discovery for many years. This is likely a result of integral definitions including numerous constants…
We explicitly evaluate a special type of multiple Dirichlet $L$-values at positive integers in two different ways: One approach involves using symmetric functions, while the other involves using a generating function of the values. Equating…
The method of brackets is an procedure to evaluate definite integrals. It is based on a small number of operational rules. The flexibility of this method is illustrated with the evaluation of an integral involving the Bessel K0 function and…
A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend…
In this paper we extend the Zeta function regularization technique, which gives a meaningful solution to divergent power series, in order to assign finite values to divergent integral of certain transcendental functions $f(x)$. The…
We consider the sums $S(k)=\sum_{n=0}^{\infty}\frac{(-1)^{nk}}{(2n+1)^k}$ and $\zeta(2k)=\sum_{n=1}^{\infty}\frac{1}{n^{2k}}$ with $k$ being a positive integer. We evaluate these sums with multiple integration, a modern technique. First, we…
We examine exponential sums of the form $\sum_{n \le X} w(n) e^{2\pi i\alpha n^k}$, for $k=1,2$, where $\alpha$ satisfies a generalized Diophantine approximation and where $w$ are different arithmetic functions that might be multiplicative,…
In this paper, we consider a discrete version of iterated integrals by the naive (equally divided) Riemann sum. In particular, basic three formulas for usual iterated integrals are discritized. Moreover, we proved cyclic sum formulas for…
The modified Mellin transform ${\cal Z}_k(s) = \int_1^\infty |\zeta({1\over2}+ix|^{2k}x^{-s}{\rm d} x$ ($k\ge1$ is a fixed integer, $s = \sigma + it$) is used to obtain estimates for $$…
The Compositional Integral is defined, formally constructed, and discussed. A direct generalization of Riemann's construction of the integral; it is intended as an alternative way of looking at First Order Differential Equations. This brief…
We present an algorithm computing the determinant of an integer matrix A. The algorithm is introspective in the sense that it uses several distinct algorithms that run in a concurrent manner. During the course of the algorithm partial…
We describe a numerical algorithm for evaluating the numbers of roots minus the number of poles contained in a region based on the argument principle with the function of interest being written as a Mellin transformation of a usually…
In the world of mathematical analysis, many counterintuitive answers arise from the manipulation of seemingly unrelated concepts, ideas, or functions. For example, Euler showed that $e^{i\pi} + 1 = 0$, whereas Gauss proved that the area…