Related papers: Average Error of the Prime Number Theorem
We verify the Hardy-Littlewood conjecture on primes in quadratic progressions on average. The results in the present paper significantly improve those of a previous paper of the authors(arXiv:math.NT/0605563).
Neural networks are able to approximate any continuous function on a compact set. However, it is not obvious how to quantify the error of the neural network, i.e., the remaining bias between the function and the neural network. Here, we…
The average properties of the well-known Subset Sum Problem can be studied by the means of its randomised version, where we are given a target value $z$, random variables $X_1, \ldots, X_n$, and an error parameter $\varepsilon > 0$, and we…
Systematic inaccuracy is inherent in any computational estimate of a non-linear average, due to the availability of only a finite number of data values, N. Free energy differences (DF) between two states or systems are critically important…
We improve upon the traditional error term in the truncated Perron formula for the logarithm of an $L$-function. All our constants are explicit.
We generalize the work of Erdos-Pomerance and Fiori-Shallue on counting Frobenius pseudoprimes from the cases of degree one and two respectively to arbitrary degree. More specifically we provide formulas for counting the number of false…
We can perform inference in Bayesian belief networks by enumerating instantiations with high probability thus approximating the marginals. In this paper, we present a method for determining the fraction of instantiations that has to be…
In this work, we develop a numerical method to study the error estimates of the $\alpha$-stable central limit theorem under sublinear expectation with $\alpha \in(0,2)$, whose limit distribution can be characterized by a fully nonlinear…
In this paper we present four necessary and sufficient conditions for a natural number to be prime.
In this paper we study the problem of statistical inference on the parameters of the semiparametric variance-mean mixtures. This class of mixtures has recently become rather popular in statistical and financial modelling. We design a…
We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$…
We introduce a new, elementary method for studying random differences in arithmetic progressions and convergence phenomena along random sequences of integers. We apply our method to obtain significant improvements on previously known…
We study the logarithm of the least common multiple of the sequence of integers given by $1^2+1, 2^2+1,..., n^2+1$. Using a result of Homma on the distribution of roots of quadratic polynomials modulo primes we calculate the error term for…
We obtain a lower bound for a number of primes in tuples. As applications, we obtain a lower bound for the Romanoff type representation functions.
Brizolis asked the question: does every prime p have a pair (g,h) such that h is a fixed point for the discrete logarithm with base g? The author and Pieter Moree, building on work of Zhang, Cobeli, and Zaharescu, gave heuristics for…
We demonstrate the impact of a generic zero-free region and zero-density estimate on the error term in the prime number theorem. Consequently, we are able to improve upon previous work of Pintz and provide an essentially optimal error term…
We have devised an alternative approach to sifting integers in the sieve of Eratosthenes that helps refine the error term. Instead of eliminating all multiples of a prime number $p<z$ in the traditional sieve method, our approach solely…
The proofs first generated by automated theorem provers are far from optimal by any measure of simplicity. In this paper I describe a technique for simplifying automated proofs. Hopefully this discussion will stimulate interest in the…
We introduce the notion of a random mean generated by a random variable and give a construction of its expected value. We derive some sufficient conditions under which strong laws of large numbers and some limit theorems hold for random…
We study the average case approximation of the Boolean mean by quantum algorithms. We prove general query lower bounds for classes of probability measures on the set of inputs. We pay special attention to two probabilities, where we show…