Related papers: Updating the error term in the prime number theore…

A Lagrange multiplier theorem is derived for the case of an imprecise objective function and a precise constraint. The proof uses methods of analysis which deal in a direct, algebraic way with imprecisions. They include imprecise…

The standard series expansion for the period of a finite amplitude pendulum as a function of energy (and hence amplitude) provides a lower limit on the period when the series is truncated. An adjustment to the last term in the truncated…

The Mertens' first theorem gives us the following asymptotic formula \begin{equation*} \sum_{\substack{p\leq x\\ p~prime}}\frac{lnp}{p}=lnx+O(1), \end{equation*} and the Mertens' second theorem indicates that there exists a constant…

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem. Our main results are the asymptotic formulas $$ \int_1^X \Delta^3(x){\rm d}x = BX^{7/4} + O_\epsilon(X^{\beta+\epsilon}) \qquad(B > 0) $$ and $$ \int_1^X…

For a fixed $\alpha$, each real number $x \in (0,1)$ can be represented by many different generalised $\alpha$-L\"uroth expansions. Each such expansion produces for the number $x$ a sequence of rational approximations $(\frac{p_n}{q_n})_{n…

For the pure biharmonic equation and a biharmonic singular perturbation problem, a residual-based error estimator is introduced which applies to many existing nonconforming finite elements. The error estimator involves the local…

Let $a>1$ be an integer. Denote by $l_a(p)$ the multiplicative order of $a$ modulo primes $p$. We prove that if $\frac{x}{\log x\log\log x}=o(y)$, then $$\frac 1 y \sum_{a\leq y}\sum_{p\leq x}\frac{1}{l_a(p)}=\log x + C\log\log…

We prove the analog of Cram\'er's short intervals theorem for primes in arithmetic progressions and prime ideals, under the relevant Riemann Hypothesis. Both results are uniform in the data of the underlying structure. Our approach is based…

Using a heuristic that relates Appell--Lerch functions to divergent partial theta functions one can expand Hecke-type double-sums in terms of Appell--Lerch functions. We give examples where the heuristic can be used as a guide to evaluate…

We prove that if $x$ is large enough, namely $x\ge x_0$, then there exists a prime between $x(1- \Delta^{-1})$ and $x$, where $\Delta$ is an effective constant computed in terms of $x_0$. This improves some previous results of Ramar\'e and…

Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…

In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number $x_0$ so that some inequality involving Chebyshev's $\vartheta$-function holds for every $x…

We determine the Lagrange function in Taylor polynomial approximation by solving an appropriate initial-value problem. Hence, we determine the remainder term which we then approximate by means of a natural cubic spline. This results in a…

We improve the quantitative estimate for Roth's theorem on three-term arithmetic progressions, showing that if $A\subset\{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert\ll N(\log\log N)^4/\log…

We study the convolution function $$ C[f(x)] := \int_1^x f(y)f({x\over y}) {{\rm d} y\over y} $$ when $f(x)$ is a suitable number-theoretic error term. Asymptotics and upper bounds for $C[f(x)]$ are derived from mean square bounds for…

In an attempt to provide an answer to the increasing criticism against p-values and to bridge the gap between statistical inference and prediction modelling, we introduce the probability of improved prediction (PIP). In general, the PIP is…

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

We study the problem of loss estimation that involves for an observable $X \sim f_{\theta}$ the choice of a first-stage estimator $\hat{\gamma}$ of $\gamma(\theta)$, incurred loss $L=L(\theta, \hat{\gamma})$, and the choice of a…

Data augmentation has been actively studied for robust neural networks. Most of the recent data augmentation methods focus on augmenting datasets during the training phase. At the testing phase, simple transformations are still widely used…