Related papers: Error estimates for Riemann sums of some singular …
We shall show that the sum of the series formed by the so-called hyperharmonic numbers can be expressed in terms of the Riemann zeta function. More exactly, we give summation formula for the general hyperharmonic series.
We establish good numerical estimates for a certain class of integrals involving sixfold products of Bessel functions. We use relatively elementary methods. The estimates will be used in the study of a sharp Fourier restriction inequality…
In this paper we find the partial sums of two kinds normalized Wright functions and the partial sums of Alexander transform of these normalized Wright functions.
We calculate the discrete moments of the characteristic polynomial of a random unitary matrix, evaluated a small distance away from an eigenangle. Such results allow us to make conjectures about similar moments for the Riemann zeta…
Assuming the Riemann Hypothesis we obtain an upper bound for the moments of the Riemann zeta-function on the critical line. Our bound is nearly as sharp as the conjectured asymptotic formulae for these moments. The method extends to moments…
Using the results of \cite{P1}, we get some estimates of warping functions for isometric immersions by changing the target manifolds by some types of Riemannian manifolds: constant space forms and Hermitian symmetric spaces. And we deal…
We give a completely elementary study for averages of short correlations of so-called sieve functions (a pretty general class of arithmetic functions).
We present a large number of analytic evaluations of Euler sums, namely sums such as \begin{align} M(m,n_0,n_1,n_2, \ldots, n_t) &= \sum_{k=1}^\infty \frac{H(k)^m}{k^{n_0} (k+1)^{n_1} (k+2)^{n_2} \cdots (k+t)^{n_t}}, \nonumber \end{align}…
Two approximations of the integral of a class of sinusoidal composite functions, for which an explicit form does not exist, are derived. Numerical experiments show that the proposed approximations yield an error that does not depend on the…
In this article we compute a discrete mean value of the derivative of the Riemann zeta function. This mean value will be important for several applications concerning the size of $\zeta'(\rho)$ where $\zeta(s)$ is the Riemann zeta function…
Using the Dirichlet integrals, which are employed in the theory of Fourier series, this paper develops a useful method for the summation of series and the evaluation of integrals.
The paper considers a universal approach that allows one to quite simply obtain nonlinear asymptotic estimates of various summation functions. It is shown the application of this approach to the asymptotic estimation of divergent Dirichlet…
By simple elementary method,we obtain with ease,a highly simple expression for the remainder term of the divisor problem and use it to obtain an Euler-Maclaurin analogue of summation involving divisor function.We also obtain a relation…
We give solutions to some extremal problems involving distance function in mixed norm spaces of harmonic functions on the unit ball of R^n
The main results extend to sums over primes in a short interval earlier estimates by the author for "long" Weyl sums over primes.
This note gives a few rapidly convergent series representations of the sums of divisors functions. These series have various applications such as exact evaluations of some power series, computing estimates and proving the existence results…
The purpose of this paper is to provide a random version of Simons' inequality.
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…
An explicit estimate for the Riemann zeta function on the critical line is derived using the van der Corput method. An explicit van der Corput lemma is presented.
The Dirichlet eta function can be divided into $n$-th partial sum $\eta_{n}(s)$ and remainder term $R_{n}(s)$. We focus on the remainder term which can be approximated by the expression for $n$. And then, to increase reliability, we make…