相关论文: Sharper bounds for the error term in the Prime Num…

We investigate the first moment of primes in progressions $$ \sum_{\substack{q\leq x/N \\ (q,a)=1}} \Big(\psi(x; q, a) - \frac x{\varphi(q)}\Big) $$ as $x, N \to \infty$. We show unconditionally that, when $a=1$, there is a significant bias…

We study the problem of $(\epsilon,\delta)$-differentially private learning of linear predictors with convex losses. We provide results for two subclasses of loss functions. The first case is when the loss is smooth and non-negative but not…

Let $K\geq 2$ be a natural number and $a_i,b_i\in\mathbb{Z}$ for $i=1,\ldots,K-1$. We use the large sieve to derive explicit upper bounds for the number of prime $k$-tuplets, i.e., for the number of primes $p\leq x$ for which all $a_ip+b_i$…

We consider the problem of the computation of $\inf_p \theta p$ over the set of exponent pairs $P \ni p$ under linear constraints for a certain class of objective functions $\theta$. An effective algorithm is presented. The output of the…

This paper is concerned with estimating the intersection point of two densities, given a sample of both of the densities. This problem arises in classification theory. The main results provide lower bounds for the probability of the…

Let $E_x(q,a)$ be the error term when counting primes in arithmetic progressions and let $M(Q)=\sum_{q\leq Q}\phi(q)\sum_{a=1}^qE_x(q,a)^3$. We show that $M(Q)<<Q^3(x/Q)^{7/5}$ for large $Q$ close to $x$ (in the usual BDH sense) thereby…

In this paper we use a theorem first proved by S.W.Golomb and a famous inequality by J.B. Rosser and L.Schoenfeld in order to prove that there exists an exact formula for $\pi(n)$ which holds infinitely often.

Let $\Psi(x,y)$ count the number of positive integers $n\le x$ such that every prime divisor of $n$ is at most $y$. Given inputs $x$ and $y$, what is the best way to estimate $\Psi(x,y)$? We address this problem in three ways: with a new…

An interesting episode in the history of the prime number theorem concerns a formula proposed by Legendre for counting the primes below a given bound. We point out that arithmetic bias likely played an important role in arriving at that…

The paper presents fundamental metrical theorems for a class of continued fraction-like expansions known as $\theta$-expansions. We first prove Khinchine's Weak Law of Large Numbers for the sum of digits, followed by the Diamond-Vaaler…

Let $\Phi(x,y)$ denote the number of integers $n\in[1,x]$ free of prime factors $\le y$. We show that but for a few small cases, $\Phi(x,y)<.6x/\log y$ when $y\le\sqrt{x}$.

In this paper, we provide a new and sharper bound for the Legendre coefficients of differentiable functions and then derive a new error bound of the truncated Legendre series in the uniform norm. The key idea of proof relies on integration…

The ultimate bound to the accuracy of phase estimates is often assumed to be given by the Heisenberg limit. Recent work seemed to indicate that this bound can be violated, yielding measurements with much higher accuracy than was previously…

We showed that the prime gap for a prime number p is less than or equal to the prime count of the prime number.

Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…

We present new sharper lower and upper bounds for the non-zero Bernoulli numbers using Euler's formula for the Riemann zeta function. In particular, we determine the best possible constants $ \alpha $ and $ \beta $ such that the double…

Although there is an extensive literature on the upper bound for cumulative standard normal distribution, there are relatively not sharp for all values of the interested argument x. The aim of this paper is to establish a sharp upper bound…

A number which is S.P in base r is a positive integer which is equal to the sum of its base-r digits multiplied by the product of its base-r digits. These numbers have been studied extensively in The Mathematical Gazette. Recently, Shah Ali…

We continue our examination the effects of certain hypothetical configurations of zeros of Dirichlet $L$-functions lying off the critical line ("barriers") on the relative magnitude of the functions $\pi_{q,a}(x)$. Here $\pi_{q,a}(x)$ is…

We have rediscovered a simple algorithm to compute the mathematical constant \[ \pi=3.14159265\cdots. \] The algorithm had been known for a long time but it might not be recognized as a fast, practical algorithm. The time complexity of it…