Pierre Dusart
Some computations made about the Riemann Hypothesis and in particular, the verification that zeroes of zeta belong on the critical line and the extension of zero-free region are useful to get better effective estimates of number theory classical functions which are closely linked to zeta zeroes like psi(x), theta(x), pi(x) or the k-th prime number.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.
We show two asymmetric estimates, one on the number of collinear triples and the other on that of solutions to $(a_1+a_2)(a_1^{\prime\prime\prime}+a_2^{\prime\prime\prime})=(a_1^\prime+a_2^\prime)(a_1^{\prime\prime}+a_2^{\prime\prime})$. As applications, we improve results on difference-product/division estimates and on Balog-Wooley decomposition: For any finite subset $A$ of $\mathbb{R}$, \[ \max\{|A-A|,|AA|\} \gtrsim |A|^{1+105/347},\quad \max\{|A-A|,|A/A|\} \gtrsim |A|^{1+15/49}. \] Moreover, there are sets $B,C$ with $A=B\sqcup C$ such that \[ \max\{E^+(B),\, E^\times (C)\} \lesssim |A|^{3…
In this paper we first establish new explicit estimates for Chebyshev's $\vartheta$-function. Applying these new estimates, we derive new upper and lower bounds for some functions defined over the prime numbers, for instance the prime counting function $π(x)$, which improve the currently best ones. Furthermore, we use the obtained estimates for the prime counting function to give two new results concerning the existence of prime numbers in short intervals.
Using evaluations of the difference between consecutive primes we develop another way of estimating of the number of primes in the interval $(n, 2n)$. We also discuss the ultra Cramer conjecture, $p_{n+1} - p_n = O(log^{1+ε}p_n)$ where $ε> 0$, in the context of the results we have obtained in our paper.
In this paper we give new estimates for integrals involving some arithmetic functions defined over prime numbers. The main focus here is on the prime counting function $π(x)$ and the Chebyshev $\vartheta$-function. Some of these estimates depend on the correctness of the Riemann hypothesis on the nontrivial zeros of the Riemann zeta function $ζ(s)$.
In this paper we establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime counting function. A further main tool is the usage of estimates concerning the reciprocal of $\log p_n$. As an application we derive refined estimates for $\vartheta(p_n)$ in terms of $n$, where $\vartheta(x)$ is Chebyshev's $\vartheta$-function.
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 \geq x_0$. Then we give some new results concerning the existence of prime numbers in short intervals. Also we derive new upper and lower bounds for some functions defined over prime numbers, for instance the prime counting function $π(x)$, which improve current best estimates of similar shape.
We prove some new lower bounds for the counting function $\mathcal N_{\mathcal C}(x)$ of the set of Novák-Carmichael numbers. Our estimates depend on the bounds for the number of shifted primes without large prime factors. In particular, we prove that $\mathcal N_{\mathcal C}(x) \gg x^{0.7039-o(1)}$ unconditionally and that $\mathcal N_{\mathcal C}(x) \gg xe^{-(7+o(1))(\log x)\frac{\log\log\log x}{\log\log x}}$, under some reasonable hypothesis.
We give an explicit form of Ingham's Theorem on primes in the short intervals, and show that there is at least one prime between every two consecutive cubes $x\sp{3}$ and $(x+1)\sp{3}$ if $\log\log x\ge 15$.
We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael numbers. Our main technical result is a new mean value theorem for primes in arithmetic progressions to large moduli. Namely, we estimate primes of size $x$ with quadrilinear forms of moduli up to $x^{17/32}$. This extends moduli beyond $x^{11/21}$, recently obtained by Maynard, improving $x^{29/56}$ from well-known 1986 work of Bombieri, Friedlander, and Iwaniec.
In this paper we use refined approximations for Chebyshev's $\vartheta$-function to establish new explicit estimates for the prime counting function $π(x)$, which improve the current best estimates for large values of $x$. As an application we find an upper bound for the number $H_0$ which is defined to be the smallest positive integer so that Ramanujan's prime counting inequality holds for every $x \geq H_0$.
Let q be a prime, A be a subset of a finite field $F=\Bbb Z/q\Bbb Z$, $|A|<\sqrt{|F|}$. We prove the estimate $\max(|A+A|,|A\cdot A|)\ge c|A|^{1+ε}$ for some $ε>0$ and c>0. This extends the result of J. Bourgain, N. Katz, and T. Tao.
In this paper, we prove some extensions of recent results given by Shkredov and Shparlinski on multiple character sums for some general families of polynomials over prime fields. The energies of polynomials in two and three variables are our main ingredients.
This submission has been withdrawn by arXiv admins due to fraudulent affiliation claims by the original submitter.
By combining and improving recent techniques and results, we provide explicit estimates for the error terms $|π(x)-\text{li}(x)|$, $|θ(x)-x|$ and $|ψ(x)-x|$ appearing in the prime number theorem. For example, we show for all $x\geq 2$ that $|ψ(x)-x|\leq 9.39x(\log x)^{1.515}\exp(-0.8274\sqrt{\log x})$. Our estimates rely heavily on explicit zero-free regions and zero-density estimates for the Riemann zeta-function, and improve on existing bounds for prime-counting functions for large values of $x$.
Using a smoothing function and recent knowledge on the zeros of the Riemann zeta-function, we compute pairs of $(Δ,x_0)$ such that for all $x \geq x_0$ there exists at least one prime in the interval $(x(1 - Δ^{-1}), x]$.
Let $K/\mathbb{Q}$ be a number field. Let $π$ and $π^\prime$ be cuspidal automorphic representations of $\mathrm{GL}_d(\mathbb{A}_K)$ and $\mathrm{GL}_{d^\prime}(\mathbb{A}_K)$, and suppose that either both $d$ and $d'$ are at most 2 or at least one of $π$ and $π^\prime$ is self-dual. When $d=d^\prime=2$, we prove an unconditional and effective log-free zero density estimate for the Rankin-Selberg $L$-function $L(s,π\otimesπ^\prime,K)$. For other choices of $d$ and $d^\prime$, we obtain similar results assuming that either $π$ or $π^\prime$ satisfies the generalized Ramanujan conjecture. With …
We establish new mean value theorems for primes of size $x$ in arithmetic progressions to moduli as large as $x^{3/5-ε}$ when summed with suitably well-factorable weights. This extends well-known work of Bombieri, Friedlander and Iwaniec, who handled moduli of size at most $x^{4/7-ε}$. This has consequences for the level of distribution for sieve weights coming from the linear sieve.
Let $N$ be the counting function of a Beurling generalized number system and let $π$ be the counting function of its primes. We show that the $L^{1}$-condition $$ \int_{1}^{\infty}|\frac{N(x)-ax}{x}|\frac{\mathrm{d}x}{x}<\infty $$ and the asymptotic behavior $$N(x)=ax+O(\frac{x}{\log x}),$$ for some $a>0$, suffice for a Chebyshev upper estimate $$ \frac{π(x)\log x}{x}\leq B<\infty. $$
In this paper we establish a number of new estimates concerning the prime counting function π(x), which improve the estimates proved in the literature. As an application, we deduce a new result concerning the existence of prime numbers in small intervals.
Let $α$ be a real number such that $1< α<2$ and let $x_0=x_0(α)$ be a {\rm(}unique{\rm)} positive solution of the equation $$ x^{α-1} -\fracπ{e^2\sqrt{3}}x +1=0. $$ Then we prove that for each positive integer $n>x_0$ there exist at least $[n^α]$ primes between the $(n+1)$th prime and the product of the first $n+1$ primes. In particular, we establish a recent Cooke's result which asserts that for each positive integer $n$ there are at least $n$ primes between the $(n+1)$th prime and the product of the first $n+1$ primes. Our proof is based on an elementary counting method (enumerative argument…
We consider the p-adic distributions derived from Eisenstein series in [GMPS], whose Mellin transforms are reciprocals of the Kubota-Leopoldt p-adic L-function. These distributions were shown there to be measures when p is regular. They fail to be measures when p is irregular; in this paper we give quantitative estimates that describe their behavior more precisely.
Motivated by the connection to the pair correlation of the Riemann zeros, we investigate the second derivative of the logarithm of the Riemann zeta function, in particular the zeros of this function. Theorem 1 gives a zero-free region. Theorem 2 gives an asymptotic estimate for the number of nontrivial zeros to height T. Theorem 3 is a zero density estimate.
Assume that $A\subseteq \Fp, B\subseteq \Fp^{*}$, $\1/4\leqslant\frac{|B|}{|A|},$ $|A|=p^α, |B|=p^β$. We will prove that for $p\geqslant p_0(β)$ one has $$\sum_{b\in B}E_{+}(A, bA)\leqslant 15 p^{-\frac{\min\{β, 1-α\}}{308}}|A|^3|B|.$$ Here $E_{+}(A, bA)$ is an additive energy between subset $A$ and it's multiplicative shift $bA$. This improves previously known estimates of this type.
Fix an elliptic curve E over Q. An extremal prime for E is a prime p of good reduction such that the number of rational points on E modulo p is maximal or minimal in relation to the Hasse bound. Assuming that all the symmetric power L-functions associated to E are automorphic and satisfy the Generalized Riemann Hypothesis, we give the first non-trivial upper bounds for the number of such primes when E is a curve without complex multiplication. In order to obtain this bound, we use explicit equidistribution for the Sato-Tate measure as in the work of Rouse and Thorner (arXiv:1305.5283) and refi…
Hardy and Littlewood conjectured that every sufficiently large integer is either a square or the sum of a prime and a square. Let $E(x)$ be the number of positive integers up to $x\ge4$ which does not satisfy this condition. We prove $E(x)\ll x^{1/2}(\log x)^A(\log\log x)^4$with $A=3/2$ under the Generalized Riemann Hypothesis. This is a small improvement of the previous remarks of Mikawa (1993) and Perelli-Zaccagnini (1995) which claims $A=4,3$ respectively.
Let $L(s, π\timesπ^\prime)$ be the Rankin--Selberg $L$-function attached to automorphic representations $π$ and $π^\prime$. Let $\tildeπ$ and $\tildeπ^\prime$ denote the contragredient representations associated to $π$ and $π^\prime$. Under the assumption of certain upper bounds for coefficients of the logarithmic derivatives of $L(s, π\times\tildeπ)$ and $L(s, π^\prime\times\tildeπ^\prime)$, we prove a log-free zero-density estimate for $L(s, π\timesπ^\prime)$ which generalises a result due to Fogels in the context of Dirichlet $L$-functions. We then employ this log-free estimate in studying …
Using some simple combinatorial arguments, we establish some new estimates for the prime counting function and its allied functions. In particular we show that \begin{align}π(x)=Θ(x)+O\bigg(\frac{1}{\log x}\bigg), \nonumber \end{align}where \begin{align}Θ(x)=\frac{θ(x)}{\log x}+\frac{x}{2\log x}-\frac{1}{4}-\frac{\log 2}{\log x}\sum \limits_{\substack{n\leq x\\Ω(n)=k\\k\geq 2\\2\not| n}} \frac{\log (\frac{x}{n})}{\log 2}.\nonumber \end{align}This is an improvement to the estimate \begin{align}π(x)=\frac{θ(x)}{\log x}+O\bigg(\frac{x}{\log^2 x}\bigg)\nonumber \end{align}found in the literature.
In this paper we establish explicit upper and lower bounds for the ratio of the arithmetic and geometric means of the prime numbers, which improve the current best estimates. Further, we prove several conjectures related to this ration stated by Hassani. In order to do this, we use explicit estimates for the prime counting function, Chebyshev's $\vartheta$-function and the sum of the first $n$ prime numbers.
In 1982, Erdös and van Lint showed an estimate for the average of the ratio of the smallest and largest prime divisor of $n$. In this note, we apply C.H. Jia's method to give an estimate for the average of positive integer power of the ratio.
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which are known as constellations. In this paper, we use those enumerations to estimate the numbers of these constellations that occur as constellations among prime numbers, and we compare these estimates with computational results. We include in our estimates the constellations corresponding to three and four consecutive primes in arithmetic progression. For these initial e…
This paper updates the explicit interval estimate for primes between consecutive powers. It is shown that there is least one prime between $n^{155}$ and $(n+1)^{155}$ for all $n\geq 1$. This result is in part obtained with a new explicit version of Goldston's 1983 estimate for the error in the truncated Riemann--von Mangoldt explicit formula.
There is a large literature on the asymptotic distribution of numbers free of large prime factors, so-called $\textit{smooth}$ or $\textit{friable}$ numbers. But there is very little known about this distribution that is numerically explicit. In this paper we follow the general plan for the saddle point argument of Hildebrand and Tenenbaum, giving explicit and fairly tight intervals in which the true count lies. We give two numerical examples of our method, and with the larger one, our interval is so tight we can exclude the famous Dickman-de Bruijn asymptotic estimate as too small and the Hil…
Divisibility Estimates for Gaussian Norms and Almost-Prime Orders of a CM Elliptic Curve
该研究针对椭圆曲线E:y²=x³-x，结合高斯CM筛框架与交叉项，证明了特定素数p下#E(F_p)/8的无平方因子性及素因子个数限制，为相关数论问题提供了可除性估计与分布结果。
The variance of integers without small prime factors in short intervals
本研究聚焦短区间内无小素因子整数的方差问题，采用复分析与筛法理论得到某范围内的无条件渐近结果，发现该方差与y-光滑数统计相关，且区间长度达y的幂次时其渐近值小于朴素概率预测。
We provide new sufficient conditions for Chebyshev estimates for Beurling generalized primes. It is shown that if the counting function $N$ of a generalized number system satisfies the $L^{1}$-condition $$ \int_{1}^{\infty}|\frac{N(x)-ax}{x}|\frac{\mathrm{d}x}{x}<\infty $$ and $N(x)=ax+o(x/\log x),$ for some $a>0$, then $$ 0<\liminf_{x\to\infty}\frac{ψ(x)}{x}\ \ \ {and}\ \ \ \limsup_{x\to\infty}\frac{ψ(x)}{x}<\infty $$ hold. We give an analytic proof of this result. It is based on Wiener division theorem. Our result extends those of Diamond (Proc. Amer. Math. Soc. 39 (1973), 503--508) and Zhan…
It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes $n^3$ and $(n+1)^3$ for all $n \geq \exp(\exp(33.3))$. To prove this, we first derive an explicit version of the Riemann--von Mangoldt explicit formula. We then assume the Riemann hypothesis and show that there will be a prime in the interval $(x-4/ π\sqrt{x} \log x, x]$ for all $x > 2$. Moreover, we show that the constant $4/π$ can be reduced to $(1+ε)$ fo…
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 concerning Mandl's inequality on the sum of the first $n$ prime numbers. We use these results to find new explicit estimates for the sum of the first $n$ prime numbers, which improve the currently best known estimates.
The main results extend to sums over primes in a short interval earlier estimates by the author for "long" Weyl sums over primes.
Primes in arithmetic progressions and short intervals without $L$-functions
本研究提出一种可检测乘法结构集合中素数的筛法，给出了Linnik最小素数问题和短区间素数存在性的无$L$-函数新证明，为相关数论问题提供了新的研究工具。
From explicit estimates for the primes to explicit estimates for the Möbius function II
本文改进了对素数和莫比乌斯函数的显式估计，通过纳入最新计算结果并优化方法，提供了更精确的上界估计。
The theorem below gives another way of computing the distribution prime counting function without using recursion and the values of Prime numbers
Exponential sums over integers without large prime divisors
本文通过更精确地利用无大素因子整数的因数分解并结合Type I和Type II界，改进了此类整数及其 $ν$ 次幂上的指数和的现有界限。
We give estimates from below for the greatest prime factor of the n-th term of a binary recurrence sequence.
For $k\ge1$, let $R_k(x)$ denote the reciprocal sum up to $x$ of numbers with $k$ prime factors, counted with multiplicity. In prior work, the authors obtained estimates for $R_k(x)$, extending Mertens' second theorem, as well as a finer-scale estimate for $R_2(x)$ up to $(\log x)^{-N}$ error for any $N > 0$. In this article, we establish the limiting behavior of the higher Mertens constants from the $R_2(x)$ estimate. We also extend these results to $R_3(x)$, and we remark on the general case $k\ge4$.
Let ${\mathcal H}$ be a multiplicative subgroup of $\mathbb{F}_p^*$ of order $H>p^{1/4}$. We show that $$ \max_{(a,p)=1}\left|\sum_{x\in {\mathcal H}} {\mathbf{\,e}}_p(ax)\right| \le H^{1-31/2880+o(1)}, $$ where ${\mathbf{\,e}}_p(z) = \exp(2 πi z/p)$, which improves a result of Bourgain and Garaev (2009). We also obtain new estimates for double exponential sums with product $nx$ with $x \in {\mathcal H}$ and $n \in {\mathcal N}$ for a short interval ${\mathcal N}$ of consecutive integers.
A pretentious proof of Linnik's estimate for primes in arithmetic progressions
本文采用pretentious方法，基于pretentious大筛法思想与积性函数处理思路，证明了算术级数上von Mangoldt函数之和的强一致估计，该估计与Linnik的相关经典估计类似。
Primes and Bivariate Polynomials without Constant Terms: A Recursive Algorithm
本文提出一种初等递归算法，通过分析gcd可整除性模式，高效判定无常数项二元多项式无法产生素数值，结果强于Bouniakowsky条件否定，适用于广泛多项式类别。
Quartic Gauss sums over primes and metaplectic theta functions
本文改进了四次高斯和的估计，并引入了新的数学工具，同时推测了相关矩的渐进行为。
An explicit version of Bombieri's log-free density estimate and Sárközy's theorem for shifted primes
本文给出 Bombieri 无对数密度估计的显式版本，并结合 Green 的工作证明：若集合 A⊆{1,…,N} 中任意两元素之差不为 p−1（p 为素数），则 |A|≪N^{1−1/10^{18}}，从而加强了 Sárközy 定理。
We prove two estimates for averages of sums of Kloosterman fractions over primes. The first of these improves previous results of Fouvry-Shparlinski and Baker.
We estimate the number of primes represented by a general quadratic polynomial with discriminant $Δ$, assuming that the corresponding real character is exceptional.
Character sums to prime power moduli evaluated at binary quadratic forms
研究素数幂模下二元二次型的特征和估计，采用p进分析方法，补充Heath-Brown对平方自由模的估计。
We show that the largest prime factor of $n^2+1$ is infinitely often greater than $n^{1.279}$. This improves the result of de la Bretèche and Drappeau (2019) who obtained this with $1.2182$ in place of $1.279.$ The main new ingredients in the proof are a new Type II estimate and using this estimate by applying Harman's sieve method. To prove the Type II estimate we use the bounds of Deshouillers and Iwaniec on linear forms of Kloosterman sums. We also show that conditionally on Selberg's eigenvalue conjecture the exponent $1.279$ may be increased to $1.312.$
A note on zero-density approaches for the difference between consecutive primes
本研究推广了短区间素数相关的Ingham定理与Heath-Brown和Iwaniec的结果，明晰了无零点区域、零密度估计和短区间素数的关联，还在密度假设下改进了素数定理成立的短区间范围。
This paper introduces a general technique for estimating the absolute value of pure Gaussian sums of order k over a prime p for a class of composite order k. The new estimate improves the classical estimate by a factor of about 2 or better (depending on k) for all sufficiently large primes p.
We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to construct an elliptic curve over prime field using complex multiplication method.
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
In this paper, we use a recent method given by Rudnev, Shakan, and Shkredov (2018) to improve results on sum-product type problems due to Pham and Mojarrad (2018).
We consider a certain equidistributed sequence of rational numbers constructed from the primes. In particular, we determine the sharp convergence rate for the star discrepancy of said sequence. Our arguments are based on well-known discrepancy estimates for inversive congruential pseudorandom numbers together with asymptotic formulae involving prime numbers.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。