相关论文: Some information-theoretic computations related to…

Building upon the work of Chebyshev, Shannon and Kontoyiannis, it may be demonstrated that Chebyshev's asymptotic result: \begin{equation} \ln N \sim \sum_{p \leq N} \frac{1}{p} \cdot \ln p \end{equation} has a natural information-theoretic…

Let $\{p_n\}_{n\ge 1}$ be the sequence of primes and $\vartheta(x) = \sum_{p \leq x} \log p$, where $p$ runs over the primes not exceeding $x$, be the Chebyshev $\vartheta$-function. In this note we derive lower and upper bounds for…

In 1737 Leonard Euler gave what we often now think of as a new proof, based on infinite series, of Euclid's theorem that there are infinitely many prime numbers. Our short paper uses a simple modification of Euler's argument to obtain new…

An asymptotic formula for the sum of the first n primes is derived. This result improves the previous results of P. Dusart. Using this asymptotic expansion, we prove the conjectures of R. Mandl and G. Robin on the upper and the lower bound…

We present the formalization of Dirichlet's theorem on the infinitude of primes in arithmetic progressions, and Selberg's elementary proof of the prime number theorem, which asserts that the number $\pi(x)$ of primes less than $x$ is…

We prove a kind of "almost all symmetry" result for the primes, i.e. we give non-trivial bounds for the "symmetry integral", say $I_{\Lambda}(N,h)$, of the von Mangoldt function $\Lambda(n)$ ($:= \log p$ for prime-powers $n=p^r$, 0…

We extend known results on the number of solutions to a linear equation in at least three prime numbers when the primes involved are required to lie in specified Chebotarev classes. We prove asymptotic results similar to previous ones only…

We give more evidence for Patterson's conjecture on sums of exponential sums, by getting an asymptotic for a sum of quartic exponential sums over $\Q[i].$ Previously, the strongest evidence of Patterson's conjecture over a number field is…

For every integer $n\ge 1$ let $a_n$ be the smallest positive integer such that $n+a_n$ is prime. We investigate the behavior of the sequence $(a_n)_{n\ge 1}$, and prove asymptotic results for the sums $\sum_{n\le x} a_n$, $\sum_{n\le x}…

Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

Elliott and Halberstam proved that $\sum_{p<n} 2^{\omega(n-p)}$ is asymptotic to $\phi(n)$. In analogy to the Erd\H{o}s--Kac Theorem, Elliott conjectured that if one restricts the summation to primes $p$ such that $\omega(n-p)\le 2 \log…

Let $\omega^*(n)$ be the number of primes $p$ such that $p-1$ divides $n$. Assuming the Elliott--Halberstam Conjecture, we prove a conjecture posted by M. R. Murty and V. K. Murty in 2021 which states that $$\sum_{n\leqslant…

The PCP Theorem is one of the most stunning results in computational complexity theory, a culmination of a series of results regarding proof checking it exposes some deep structure of computational problems. As a surprising side-effect, it…

In this paper we establish a general asymptotic formula for the sum of the first $n$ prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin. Further we prove a series of results…

We investigate exponential sums over those numbers $\leq x$ all of whose prime factors are $\leq y$. We prove fairly good minor arc estimates, valid whenever $\log^{3}x \leq y \leq x^{1/3}$. Then we prove sharp upper bounds for the $p$-th…

When restricted to some non-negative multiplicative function, say f, bounded on primes and that vanishes on non square-free integers, our result provides us with an asymptotic for $\sum_{n \le X}f(n)/n$ with error term $O((\log…

This extended abstract presents a logic, called Lp, that is capable of representing and reasoning with a wide variety of both qualitative and quantitative statistical information. The advantage of this logical formalism is that it offers a…

An "entropy increasing to the maximum" result analogous to the entropic central limit theorem (Barron 1986; Artstein et al. 2004) is obtained in the discrete setting. This involves the thinning operation and a Poisson limit. Monotonic…

It is well known that $\sum_{p\le n} 1/p =\ln(\ln(n)) + O(1)$ where $p$ goes over the primes. We give several known proofs of this. We first present a a proof that $\ge \ln(\ln(n)) + O(1)$. This is based on Euler's proof that $\sum_p 1/p$…