Related papers: Another estimating the absolute value of Mertens f…

We will prove that for every $m\geq 0$ there exists an $\varepsilon=\varepsilon(m)>0$ such that if $0<\lambda<\varepsilon$ and $x$ is sufficiently large in terms of $m$ and $\lambda$, then $$|\lbrace n\leq x: |[n,n+\lambda\log n]\cap…

Real and imaginary part of the limit 2N->infinity of the integral int_{x=1..2N} exp(i*pi*x)*x^(1/x) dx are evaluated to 20 digits with brute force methods after multiple partial integration, or combining a standard Simpson integration over…

Classical algorithms in numerical analysis for numerical integration (quadrature/cubature) follow the principle of approximate and integrate: the integrand is approximated by a simple function (e.g. a polynomial), which is then integrated…

We present a mathematical analysis of transformations used in fast calculation of inverse square root for single-precision floating-point numbers. Optimal values of the so called magic constants are derived in a systematic way, minimizing…

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 study the approximation error $\varepsilon(x)=\operatorname{li}_{*}(x)-\operatorname{li}(x)$ arising from the classical Stieltjes asymptotic expansion for the logarithmic integral. Our analysis is based on the discrete values…

Let $p(x)=a_0 + a_1 x + \ldots + a_n x^n$ be a polynomial with all roots real and satisfying $x \leq -\delta$ for some $0<\delta <1$. We show that for any $0 < \epsilon <1$, the value of $p(1)$ is determined within relative error $\epsilon$…

The task of mixture proportion estimation (MPE) is to estimate the weight of a component distribution in a mixture, given observations from both the component and mixture. Previous work on MPE adopts the irreducibility assumption, which…

Let $M(x)$ denote the largest cardinality of a subset of $\{n \in \mathbf{N}: n \leq x\}$ on which the Euler totient function $\varphi(n)$ is non-decreasing. We show that $M(x) = (1+O(\frac{(\log\log x)^5}{\log x})) \pi(x)$ for all $x \geq…

For an irrational number $\alpha\in\mathbb{R}$ we consider its irrationality measure function $$ \psi_\alpha(x) = \min_{1\le q\le x,\, q\in\mathbb{Z}} \| q\alpha \|. $$ It is known for all irrational numbers $\alpha$ and $\beta$ satisfying…

We present a randomized algorithm for estimating the permanent of an $M \times M$ real matrix $A$ up to an additive error. We do this by viewing the permanent $\mathrm{perm}(A)$ of $A$ as the expectation of a product of centered joint…

This is an elementary introduction to infinite-dimensional probability. In the lectures, we compute the exact mean values of some functionals on C[0,1] and L[0,1] by considering these functionals as infinite-dimensional random variables.…

In this paper we are concerned with fully automatic and locally adaptive estimation of functions in a "signal + noise"-model where the regression function may additionally be blurred by a linear operator, e.g. by a convolution. To this end,…

Roughly speaking, the spectrum of multiplicative functions is the set of all possible mean values. In this paper, we are interested in the spectra of multiplicative functions supported over powerful numbers. We prove that its real…

The paper considers estimates for some sums and products of functions of prime numbers. Several assertions on this topic have been proven. We also study extremal estimates for strongly additive and strongly multiplicative arithmetic…

We prove that for any compact set B in R^d and for any epsilon >0 there is a finite subset X of B of |X|=d^{O(1/epsilon^2)} points such that the maximum absolute value of any linear function ell: R^d --> R on X approximates the maximum…

We prove a $\mathsf{C}^1$-elliptic estimate of the form $ \sup_{B(x,r/2)} |\mathrm{grad} (\psi) | \leq C \left\{ \sup_{B(x,r)} |\Delta \psi| + \sup_{B(x,r)} |\psi| \right\}, $ valid on any complete Riemannian manifold $M$ and for any smooth…

We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…

We study the double sum $S_\varepsilon(X)$$=$$\sum_{\substack{d,e\le X}}\frac{\mu(d)\mu(e)}{[d,e]^{1+\varepsilon}}$, which converges even in the case $\varepsilon=0$, where $\mu$ denotes the M\"obius function and $[d,e]$ is the least common…

We present an algorithm to invert the Euler function $\phi(m)$. The algorithm, for a given $n \geq 1$, in polynomial time ``on average'', finds the set $\Psi(n)$ of all solutions $m$ to $\phi(m) = n$. In fact, in the worst case, $\Psi(n)$…