S. V. Konyagin
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We obtain the triple correlations for a truncated divisor sum related to primes. We also obtain the mixed correlations for this divisor sum when it is summed over the primes, and give some applications to primes in short intervals.
The paper solves the problems of determining the asymptotics of the number of primes and the sums of functions of primes in a subset of the natural series that satisfies the conditions that the asymptotic density of the number of primes in this subset is constant and not equal to zero.
Let $\mathbf H_2$ denote the set of even integers $n \not\equiv 1 \pmod 3$. We prove that when $H \ge X^{0.33}$, almost all integers $n \in \mathbf H_2$, $X < n \le X + H$ can be represented as the sum of a prime and the square of a prime. We also prove a similar result for sums of three squares of primes.
We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.
Assuming the Riemann Hypothesis we prove that the interval $[N, N + H]$ contains an integer which is a sum of a prime and two squares of primes provided that $H \ge C (\log N)^{4}$, where $C > 0$ is an effective constant.
We obtain the general k-correlations for a short divisor sum related to primes.
We know that any prime number of form $4s+1$ can be written as a sum of two perfect square numbers. As a consequence of Goldbach's weak conjecture, any number great than $10$ can be represented as a sum of four primes. We are motivated to consider an equation with some constraints about digital sum for the four primes. And we conclude that the square root of the digital sum of the four primes will greater than $4$ and will not be a multiple of $3$ if the equation has solutions. In the proof, we give the method of determining whether a number is a perfect square.
In this paper we prove a weighted sum formula for multiple harmonic sums modulo primes, thereby proving a weighted sum formula for finite multiple zeta values. Our proof utilizes difference equations for the generating series of multiple harmonic sums. We also conjecture several weighted sum formulas of similar flavor for finite multiple zeta values.
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 obtain new results on additive properties of the set $$ I^{-1}= \{x^{-1}: \quad x\in I\} $$ where $I$ is an arbitrary interval in the field of residue classes modulo a large prime $p$. We combine our results with multilinear exponential sum estimates and obtain new results on incomplete multilinear Kloosterman sums.
We prove that every integer greater than two may be written as the sum of a prime and a square-free number.
Some explicit results on the sum of a prime and an almost prime
本文受 Rényi 经典结果启发，显式证明了每个不小于 4 的偶数可表示为一个素数与一个至多含 395 个素因子的殆素数之和，并在广义黎曼假设下将素因子数改进到 31。
Let $γ<1<c$ and $19(c-1)+171(1-γ)<9$. In this paper, we establish an asymptotic formula for exponential sums over Piatetski-Shapiro primes $p=[n^{1/γ}]$ in arithmetic progressions.
We present lower bounds on the sum and product of the distinct prime factors of an odd perfect number, which provide a lower bound on the size of the odd perfect number as a function of the number of its distinct prime factors.
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.
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 in 1996.
We show that the product of two consecutive Fibonacci (respectively Lucas) numbers is divisible by the sum of their indices if this sum is a prime number different from 5 and in the form (4r+1)(respectively (4r+3)).
We show that the set of the numbers that are the sum of a prime and a Fibonacci number has positive lower asymptotic density.
We obtain a simple relations for the Newman sum over multiples of a prime with a primitive or semiprimitive root 2. We consider the case of p=17 as well.
An inequality involving primes and the product of primes
本文证明了一个涉及素数及连续素数乘积的不等式。
Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones previously known.
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 of the sum of the first n primes respectively.
We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.
The congruences for Jacobi sums of some lower orders has been treated by many authors in the literature. In this paper we establish the congruences for Jacobi sums of order 2l^2 with odd prime l. These congruences are useful to obtain algebraic and arithmetic characterizations for Jacobi sums of order 2l^2 .
The set of integers which can be written as the sum of four prime cubes has lower density at least $0.009664$. This improves earlier bounds of $0.003125$ by Ren and $0.005776$ by Liu.
We prove that every positive integer $n$ which is not equal to $1$, $2$, $3$, $6$, $11$, $30$, $155$, or $247$ can be represented as a sum of a squarefree number and a prime not exceeding $\sqrt{n}$.
It is known that the sum of the reciprocal of integers, $\sum_n (1/n)$, and the sum of the reciprocal of primes, $\sum_n (1/p_n)$, both diverge. Here, we study a series made from primes that sums exactly to 1. We also show this sum is simply related to an infinite product over primes. We then generalize the form of the series (and its related product), extending this idea to other number theoretic sets such as twin primes. Evaluating a product made from twin primes gives a new mathematical constant.
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.
The main objective of this article is to study the exponential sums associated to Fourier coefficients of modular forms supported at numbers having a fixed set of prime factors. This is achieved by establishing an improvement on Shparlinski's bound for exponential sums attached to certain recurrence sequences over finite fields.
In this paper we show that if $A$ is a subset of Chen primes with positive relative density $α$, then $A+A$ must have positive upper density at least $cαe^{-c^\prime\log(1/α)^{2/3}(\log\log(1/α))^{1/3}}$ in the natural numbers.
If n is a positive integer, let h(n) denote the maximal value of the product of distinct primes whose sum does not exceed n. We give some properties of this function h and describe an algorithm able to compute h(n) for large values of n.
A Density Theorem for Higher Order Sums of Prime Numbers
该研究证明下密度严格大于1/2的素数子集可表所有充分大偶数为其4个素数之和，还推广到k≥4个加项及k≥4个不同素数子集的情形，以初等组合引理为核心新贡献，延伸了此前的两、三素数和相关研究。
Exploring the Representation of Large Positive Integers as Sums of Prime Powers and Integer Powers: Analysis with Positive Density Subsets
本文利用转换原理研究大正整数表示为素数幂与整数幂之和的问题，其中素数和整数幂分别取自正密度子集，拓展了加法数论中的表示理论。
We will generalize the combinatorial algorithms for computing $π(x)$ to compute sums ${F(x) = \sum_{p \leq x} p^k}$ for $k \in \mathbb{Z}_{\geq 0}$. The detailed exposition of algorithms is included along with implementation details.
For $q$ prime, $X \geq 1$ and coprime $u,v \in \mathbb{N}$ we estimate the sums \begin{equation*} \sum_{\substack{p \leq X \substack p \equiv u \hspace{-0.25cm} \mod{v} p \text{ prime}}} \text{Kl}_2(p;q), \end{equation*} where $\text{Kl}_2(p;q)$ denotes a normalised Kloosterman sum with modulus $q$. This is a sparse analogue of a recent theorem due to Blomer, Fouvry, Kowalski, Michel and Milićević showing cancellation amongst sums of Kloosterman sums over primes in short intervals. We use an optimisation argument inspired by Fouvry, Kowalski and Michel. Our argument compares three different bo…
Assuming that the Generalized Riemann Hypothesis (GRH) holds, we prove an explicit formula for the number of representations of an integer as a sum of $k\geq 5$ primes. Our error terms in such a formula improve by some logarithmic factors an analogous result by Friedlander-Goldston.
A sharp asymptotic formula for the sum of reciprocals of $π(n)$ is derived, where $π(x)$ is the number of primes not exceeding $x$. This result improves the previous results of De Koninck--Ivić and L. Panaitopol.
Quartic Gauss sums over primes and metaplectic theta functions
本文改进了四次高斯和的估计，并引入了新的数学工具，同时推测了相关矩的渐进行为。
Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best possible.
A Positive Lower Bound for the Sum of Log-Reciprocal Twin Prime Products via Weighted Sieve
本文通过改进加权筛法，证明了孪生素数乘积对数倒数之和的正下界，从而推导出孪生素数对的无限性。
Problems 66 and 67 on sums of residue classes and primes of András Sárközy's collection of unsolved problems
本文讨论András Sárközy 2001年未解决问题集中的第66、67题，证明了素数稀疏子集和集的最优结果。
Computational results on sums of a prime with squares or cubes
本文通过计算验证了素数加两个平方数或立方数的表示猜想，证明了特定范围内所有整数均可表示，并利用椭圆曲线整点方法实现。
In this paper, I proved that $$N=p_1+p_2+2p_3, p_1\sim N/2, p_2\sim N/2, p_3=o(N),$$ where $N$ is a large even number, and $p_i\ (i=1,2,3)$ are odd primes.
We study the arithmetic function sopfr$(n)$ (OEIS A001414) which gives the sum of prime factors (with repetition) of a number $n$. In particular we obtain the asymptotic formula $$ \sum_{n \leq x} \rm{sopfr}(n) \sim \frac{π^2}{12} \frac{x^2}{\log x},$$ which holds as well for the function sopf$(n)$ (OEIS A008472) that just gives the sum of distinct prime factors of $n$. This asymptotic formula was already stated by R. Jakimcyuk \cite{rj12} which was brought to our attention after the completion of the first version of this manuscript.
We study the Goldbach problem for primes represented by the polynomial $x^2+y^2+1$. The set of such primes is sparse in the set of all primes, but the infinitude of such primes was established by Linnik. We prove that almost all even integers $n$ satisfying certain necessary local conditions are representable as the sum of two primes of the form $x^2+y^2+1$. This improves a result of Matomäki, which tells that almost all even $n$ satisfying a local condition are the sum of one prime of the form $x^2+y^2+1$ and one generic prime. We also solve the analogous ternary Goldbach problem, stating tha…
We show that the binomial and related multiplicative character sums $$ \sum_{\stackrel{x=1}{(x,p)=1}}^{p^m} χ(x^l(Ax^k +B)^w),\hspace{3ex} \sum_{x=1}^{p^m} χ_1 (x)χ_2(Ax^k +B), $$ have a simple evaluation for large enough $m$ (for $m\geq 2$ if $p\nmid ABk$).
Character sums to prime power moduli evaluated at binary quadratic forms
研究素数幂模下二元二次型的特征和估计，采用p进分析方法，补充Heath-Brown对平方自由模的估计。
On the sum of a prime and a square-free number co-prime to any integer with at most two prime factors
研究证明大于2的自然数可表示为素数与特定平方数之和，并明确给出了渐进行为结果。
Let $Λ\left(n\right)$ be the von Mangoldt function and $r_{SP}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}Λ\left(m_{1}\right)Λ\left(m_{2}\right)Λ\left(m_{3}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares of primes. Let $N$ a sufficiently large integer, let $k>3/2$ and let $M_{i}\left(N,k\right),\, i=1,\dots,4$ suitable parameters depending on $Γ(s)$. We prove that $$\sum_{n\leq N}r_{SP}\left(n\right)\frac{\left(N-n\right)^{k}}{Γ\left(k+1\right)}=M_{1}\left(N,k\right)+M_{2}\left(N,k\right)+M_{3}\left(N,k\right)+M_{4}\left(N,k\right)+O…
Let $\mathcal{A}'$ be the set of integers missing any three fixed digits from their decimal expansion. We produce primes in a thin sequence by proving an asymptotic formula for counting primes of the form $p = m^2 + \ell^2$, with $\ell \in \mathcal{A}'$. The proof draws on ideas from the work of Friedlander-Iwaniec on primes of the form $p = x^2+y^4$, as well as ideas from the work of Maynard on primes with restricted digits.
We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit new phenomena concerning Chebyshev-type biases of such sums when the number of irreducible factors is very large.
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…
On the representation of large even integers as the sum of eight primes from positive density sets
本文证明若素数子集 A 在素数中的下密度大于 1/2，则每个充分大的偶数均可表示为 A 中八个素数之和，且常数 1/2 是最佳的。
Real exponential sums over primes and prime gaps
研究证明在短区间内存在素数，解决了长期存在的问题，并验证了关于素数分布的旧猜想。
Improvements on exponential sums related to Piatetski-Shapiro primes
本文通过改进Type I和的方法，提高了与Piatetski-Shapiro素数相关的三次哥德巴赫问题的界，并研究了这些素数在算术级数和Beatty序列交集中的分布。
Let $p$ be a prime. We define $S(p)$ the smallest number $k$ such that every positive integer is a sum of at most $k$ squares of integers that are not divisible by $p$. In this article, we prove that $S(2)=10$, $S(3)=6$, $S(5)=5$, and $S(p)=4$ for any prime $p$ greater than $5$. In particular, it is proved that every positive integer is a sum of at most four squares not divisible by $5$, except the unique positive integer $79$.
We prove that the Kloosterman sum $S(1,1;c)$ can change sign infinitely often as $c$ runs over squarefree moduli with at most 10 prime factors, which improves the previous results of E. Fouvry and Ph. Michel, J. Sivak-Fischler and K. Matomäki, replacing 10 by 23, 18 and 15, respectively. The method combines the Selberg sieve, equidistribution of Kloosterman sums and spectral theory of automorphic forms.
We prove an isomorphism between the finite domain from 1 up to the product of the first n primes and the new defined set of prime modular numbers. This definition provides some insights about relative prime numbers. We provide an inverse function from the prime modular numbers into this finite domain. With this function we can calculate all numbers from 1 up to the product of the first n primes that are not divisible by the first n primes. This function provides a non sequential way for the calculation of prime numbers.
Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^αd_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log X}~\qquad\quad~ &α=-1,\\ \frac{X}{\log X}\frac{(\log\log X)^{1+α}}{1+α}\qquad &α>-1, \end{cases} \end{align*} and establish asymptotic properties for some series of $d_n$ without the Hardy--Littlewood prime-pair conjecture.
For integer $q$, let $χ$ be a primitive multiplicative character$\pmod q.$ For integer $a$ coprime to $q$, we obtain a new bound for the sums $$\sum_{n\le N}Λ(n)χ(n+a),$$ where $Λ(n)$ is the von Mangoldt function. This bound improves and extends the range of a result of Friedlander, Gong and Shparlinski
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。