Related papers: Harmonic numbers and the prime counting function
By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.
An approximate formula for complex Riemann Xi function, previously developed, is used to refine Backlund's estimate of the number of zeros till a chosen imaginary coordinate
We describe an algorithm for arbitrary-precision computation of the elementary functions (exp, log, sin, atan, etc.) which, after a cheap precomputation, gives roughly a factor-two speedup over previous state-of-the-art algorithms at…
We supplement the result of the first part of the work with estimates of the integrals of the difference of subharmonic functions in measure with some deterioration of the absolute constants, but these estimates have the form of a…
Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…
This paper shows the equivalence of the Riemann hypothesis to an sequence of elementary inequalities involving the harmonic numbers H_n, the sum of the reciprocals of the integers from 1 to n. It is a modification of a criterion due to Guy…
We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…
We prove that the Riemann hypothesis is equivalent to the condition $\int_{2}^x\left(\pi(t)-\text{li}(t)\right)\mathrm{d}t<0$ for all $x>2$. Here, $\pi(t)$ is the prime-counting function and $\text{li}(t)$ is the logarithmic integral. This…
In this paper we first establish new explicit estimates for Chebyshev's $\vartheta$-function. Applying these new estimates, we derive new upper and lower bounds for some functions defined over the prime numbers, for instance the prime…
We explore a well-known integral representation of the logarithmic function, and demonstrate its usefulness in obtaining compact, easily-computable exact formulas for quantities that involve expectations and higher moments of the logarithm…
We present in this work a heuristic expression for the density of prime numbers. Our expression leads to results which possesses approximately the same precision of the Riemann's function in the domain that goes from 2 to 1010 at least.…
Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…
We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…
It is a natural question to ask which plurisubharmonic functions admit a 'nice' approximation in the sense of a decreasing equisingular approximation with analytic singularities. For arbitrary toric plurisubharmonic functions, we give a…
In the paper, we present a monotonicity result of a function involving the gamma function and the logarithmic function, refine a double inequality for the gamma function, and improve some known results for bounding the gamma function.
This article describes a sequence of rational functions which converges locally uniformly to the zeta function. The numerators (and denominators) of these rational functions can be expressed as characteristic polynomials of matrices that…
Harmonic numbers arise from the truncation of the harmonic series. The $n^\text{th}$ harmonic number is the sum of the reciprocals of each positive integer up to $n$. In addition to briefly introducing the properties of harmonic numbers, we…
We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
We give an exposition of the Newton-Leibniz calculus. We begin by defining the integral as a limit of Riemann sums, verify the integrals of the standard catalog of functions by direct manipulation, prove the substitution lemmas as theorems…