We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we assume the Riemann Hypothesis.
A new explicit formula is proved for the contribution of the major arcs in the Goldbach and Generalized Twin Prime Problem, in which the level of the major arcs can be chosen very high. This will have many applications in the approximations of the mentioned problems.
Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we establish a theorem of Bombieri-Vinogradov type for the Piatetski-Shapiro primes $p=[n^{1/γ}]$ with $\frac{85}{86}<γ<1$. Moreover, we use this result to prove that, for $0.9989445<γ<1$, there exist infinitely many Piatetski-Shapiro primes such that $p+2=\mathcal{P}_3$, which improves the previous results of Lu, Wang and Cai, and Peneva.
This paper discusses the additive prime divisor function $A(n) := \sum\limits_{p^α|| n} α\, p$ which was introduced by Alladi and Erd\H os in 1977. It is shown that $A(n)$ is uniformly distributed (mod $q$) for any fixed integer $q > 1.$
The main purpose of this survey is to introduce an inexperienced reader to additive prime number theory and some related branches of analytic number theory. We state the main problems in the field, sketch their history and the basic machinery used to study them, and try to give a representative sample of the directions of current research.
Let $E$ be a rational elliptic curve, and $K$ be an imaginary quadratic field. In this article we give a method to construct Heegner points when $E$ has a prime bigger than $3$ of additive reduction ramifying in the field $K$. The ideas apply to more general contexts, like constructing Darmon points attached to real quadratic fields which is presented in the appendix.
Let $F_p$ be the field of a prime order $p$. Then for any positive integer $n>1$, for any $ε>0$, and for any subset $A$ of $F_p$, every element of $F_p$ can be represented as a sum of $N$ elements, each of them is a product of $n$ elements from $A$, where $N$ depends on $n$ and $\espilon$.
Let $\mathtt{PRIMES}$ be the set of all primes. We show that a multiplicative function which satisfies \[ f(p+q-2) = f(p) + f(q) - f(2) \text{ for }p,q \in \mathtt{PRIMES} \] is one of the following: \begin{enumerate} \item $f$ is the identity function \item $f$ is the constant function with $f(n)=1$ \item $f(n)=0$ for $n \ge2$ unless $n$ is odd and squareful. \end{enumerate} As a consequence, a multiplicative function which satisfies \[ f(a+b) = f(a) + f(b) \text{ for }a,b \in \mathtt{PRIMES}-1 \] is the identity function.
We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We likewise treat representations of shifted primes p-1 as sums of two almost prime squares. The methods involve a combination of analytic, automorphic and algebraic arguments to handle representations by restricted binary quadratic forms with a high degree of uniformity.
In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding) conjecture. The goal of this paper is to extend and sharpen their result in three directions by using a different approach (based on the theory of $S$-unit equations).
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.
In part I of this paper we studied additive decomposability of the set $\F_y$ of th $y$-smooth numbers and the multiplicative decomposability of the shifted set $\g_y=\F_y+\{1\}$. In this paper, focusing on the case of 'large' functions $y$, we continue the study of these problems. Further, we also investigate a problem related to the m-decomposability of $k$-term sumsets, for arbitrary $k$.
We show that if $E/\mathbb{Q}$ is an elliptic curve with a rational $p$-torsion for $p=2$ or $3$, then there is a congruence relation between Ramanujan's tau function and $E$ modulo $p$. We make use of such congruences to compute the Iwasawa invariants of $2$-adic and $3$-adic Mazur--Tate elements attached to Ramanujan's tau function. We also investigate numerically the Iwasawa invariants of the Mazur--Tate elements attached to an elliptic curve with additive reduction at a fixed prime number.
Let $E$ be a rational elliptic curve and let $p$ be an odd prime of additive reduction. Let $K$ be an imaginary quadratic field and fix a positive integer $c$ prime to the conductor of $E$. The main goal of the present article is to define an anticyclotomic $p$-adic $L$-function $Ł$ attached to $E/K$ when $E/\QQ_p$ attains semistable reduction over an abelian extension. We prove that $Ł$ satisfies the expected interpolation properties; namely, we show that if $χ$ is an anticyclotomic character of conductor $cp^n$ then $χ(Ł)$ is equal (up to explicit constants) to $L(E,χ,1)$ or $L'(E,χ,1)$.
In this note we show that the methods of Motohashi and Meurman yield the same upper bound on the error term in the binary additive divisor problem. With this goal, we improve an estimate in the proof of Motohashi.
Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much more greater than the number of required iterations. In an other hand we propose new formulations of famous conjectures from the additive theory of numbers (the weak twin prime conjecture, the Polignac conjecture, the Goldbach conjecture or the very general Schinzel's hypothesis H). For the moment these are experimental results obtained using pari-gp.
Improving earlier estimates of several authors we show that the number E(X) of Goldbach exceptional even integers (that is, even integers which cannot be written as the sum of two primesw) below X satisfies tho bound E(X) < X^0.72 for sufficiently large X. In the proof crucial role is played by the explicit formula for the contribution of the major arcs proved in Part I of this series (arXiv:1804.05561). In this new version some misprints are corrected and an explanatory sentence is added to the common proof of theorems C and D.
This is an expository article to accompany my two lectures at the CDM conference. I have used this an excuse to make public two sets of notes I had lying around, and also to put together a short reader's guide to some recent joint work with T.Tao. Contents: 1. An exposition, without much detail, of the work of Goldston, Pintz and Yildirim on gaps between primes; 2. A detailed discussion of the work of Mauduit and Rivat establishing that 50 percent of the primes have odd digit sum when written in base 2; 3. A reader's guide to recent work of T.Tao and the author on linear equations in primes. T…
Fix $δ\in(0,1]$, $σ_0\in[0,1)$ and a real-valued function $\varepsilon(x)$ for which $\limsup_{x\to\infty}\varepsilon(x)\le 0$. For every set of primes ${\mathcal P}$ whose counting function $π_{\mathcal P}(x)$ satisfies an estimate of the form $$π_{\mathcal P}(x)=δ\,π(x)+O\bigl(x^{σ_0+\varepsilon(x)}\bigr),$$ we define a zeta function $ζ_{\mathcal P}(s)$ that is closely related to the Riemann zeta function $ζ(s)$. For $σ_0\le\frac12$, we show that the Riemann hypothesis is equivalent to the non-vanishing of $ζ_{\mathcal P}(s)$ in the region $\{σ>\frac12\}$. For every set of primes ${\mathcal …
Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results of Liu and Fang in 2016 and obtain some results on additive complements. For example, we prove that there exist additive complements $A$ and $B$ such that $\limsup_{x\to+\infty} A(x)B(x)/x= 2$ and $A(x)B(x) - x = 1$ for infinitely positive integers $x$.
We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.
We examine how closely a multiplicative function resembles an additive function. Given a multiplicative function $g$ and an additive function $f$, we examine the size of the quantity $E(f,g;x)=\# \{n\leq x:f(n)=g(n)\}$. We establish a lower bound for $E(Ω,g,x)$.
Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a prime power and, for each integer $n\ge 1$, let $\mathbb F_{q^n}$ be the unique $n$-degree extension of $\mathbb F_q$. The $\mathbb F_q$-orders of an element in $\mathbb F_{q^n}$ and an additive character over $\mathbb F_{q^n}$ have been extensively used in the proof of existence results over finite fields (e.g., the Primitive Normal Basis Theorem). In this note we provide an interesting relation between these two objects.
We investigate the distribution of $pθ$ modulo 1, where $θ$ is a complex number which is not contained in $\mathbb{Q}(i)$, and $p$ runs over the Gaussian primes.
We investigate sumset decompositions of quite general sets with restricted prime factors. We manage to handle certain sets, such as the smooth numbers, even though they have little sieve amenability, and conclude that these sets cannot be written as a ternary sumset. This proves a conjecture by Sárközy. We also clean up and sharpen existing results on sumset decompositions of the prime numbers.
Let $α, β\geq 0$ and $α+ β< 1$. In this short note, we show that $\liminf_{n \to \infty} p_n^β(p_{n+1}^α- p_n^α) = 0$, where $p_n$ is the $n$th prime. This notes an improvement over results of Sándor and gives additional evidence towards a conjecture of Andrica. This follows directly from recent results on prime pairs from Maynard, Tao, Zhang.
We prove that the central values of additive twists of a cuspidal $L$-function define a quantum modular form in the sense of Zagier, generalizing recent results of Bettin and Drappeau. From this we deduce a reciprocity law for the twisted first moment of multiplicative twists of cuspidal $L$-functions, similar to reciprocity laws discovered by Conrey for the twisted second moment of Dirichlet $L$-functions. Furthermore we give an interpretation of quantum modularity at infinity for additive twists of $L$-functions of weight 2 cusp forms in terms of the corresponding functional equations.
In this note, we revisit a result of Benli's and Pollack's on the number of small prime $k^{th}$ power residues. The proof is based on their idea of using reciprocity laws, but the argument is simplified and we prove a slightly stronger bound.
Let p be a prime number, and let K be a number field. For p=2, assume moreover K totally imaginary. In this note we prove the existence of asymptotically good extensions L{K of cohomological dimension 2 in which infinitely many primes split completely. Our result is inspired by a recent work of Hajir, Maire, and Ramakrishna [7].
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.
Instead of a strong quantitative form of the Hardy-Littlewood prime $k$-tuple conjecture, one can assume an average form of it and still obtains the same distribution result on $ψ(x+h) - ψ(x)$ by Montgomery and Soundararajan [1].
Let $S$ be a string of $l$ decimal digits. We give an explicit upper bound on some prime $p$ whose decimal representation contains the string $S$. We also show, as a corollary of the Green-Tao theorem, that there are arbitrarily long arithmetic progressions of prime numbers all of whose decimal representations contain $S$.
Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we give answers to some questions and prove a conjecture posed by Miska and Tóth in their recent paper concerning subsequences of the sequence of prime numbers. In particular, we establish explicit upper and lower bounds for $p_{n}^{(k)}$. We also study the behaviour of the counting functions of the sequences $(p_{n}^{(k)})_{k=1}^{\infty}$ and $(p_{k}^{(k)})_{k=1…
In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that these sequences always terminate in a power of two but can be extended infinitely to the left.
In this paper we extend and improve our results on weighted averages for the number of representations of an integer as a sum of two powers of primes. Let $1\le \ell_1 \le \ell_2$ be two integers, $Λ$ be the von Mangoldt function and % \(r_{\ell_1,\ell_2}(n) = \sum_{m_1^{\ell_1} + m_2^{\ell_2}= n} Λ(m_1) Λ(m_2) \) % be the weighted counting function for the number of representation of an integer as a sum of two prime powers. Let $N \geq 2$ be an integer. We prove that the Cesàro average of weight $k > 1$ of $r_{\ell_1,\ell_2}$ over the interval $[1, N]$ has a development as a sum of terms depe…
As a refinement of the celebrated recent work of Yitang Zhang we show that any admissible k-tuple of integers contains at least two primes and almost primes in each component infinitely often if k is at least 181000. This implies that there are infinitely many gaps between consecutive primes of size at most 2530338, with an improved admissible k-tuple of Andrew W. Sutherland to 2326476.
A binary string representation of prime occurrences is a sequence of bits, where $1$ entries encode positions of prime numbers. This is a convenient representation for analysis of prime distribution, since it allows for application of a broad range of existing string-analysis algorithms to problems in number theory. Binary strings of prime occurrences can be also generated with simple algorithms. Here we discuss three such algorithms and we demonstrate their applicability using the example of proving Goldbach's hypothesis for some limited sets of even numbers. This work formulates three open q…
Assuming the Riemann hypothesis, this article discusses a new elementary argument that seems to prove that the maximal prime gap of a finite sequence of primes p_1, p_2, ..., p_n <= x, satisfies max {p_(n+1) - p_n : p_n <= x} <= c1((logx)^2)/loglogx, c1 > 0 constant. Equivalently, it shows that the very short intervals (x, x + y] contain prime numbers for all y > c2((logx)^2)/loglogx, c2 > 0 constant, and sufficiently large x > 0.
We remove logarithmic factors in error term estimates in asymptotic formulas for the number of solutions of a class of additive congruences modulo a prime number.
These notes are based on my four lectures given at the Newton Institute in April 2004 during the Recent Perspectives in Random Matrix Theory and Number Theory Workshop. Their purpose is to introduce the reader to the analytic number theory necessary to understand Montgomery's work on the pair correlation of the zeros of the Riemann zeta-function and subsequent work on how this relates to prime numbers. A very brief introduction to Selberg's work on the moments of $S(T)$ is also given.
Let $\{p_j(n)\}_{j=1}^{ω(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erdős implying that, for any function $ξ(n)$ tending to infinity with $n$, we have $$f(n):=\max_{1\leqslant j<ω(n)}\log \Big({\log p_{j+1}(n)\over \log p_j(n)}\Big)=\log_3n+O(ξ(n))$$ for almost all integers $n$.
Suppose that $O_L$ is the ring of integers of a number field $L$, and suppose that $f(z)=\sum_{n=1}^\infty a_f(n)q^n\in S_k\cap O_L[[q]]$ (note: $q := e^{2πiz}$) is a normalized Hecke eigenform for $\mathrm{SL}_2(\mathbb{Z})$. We say that $f$ is non-ordinary at a prime $p$ if there is a prime ideal $\mathfrak{p}\subset O_L$ above $p$ for which $a_f(p)\equiv 0 \ (mod\ {\mathfrak{p}})$. For any finite set of primes $S$, we prove that there are normalized Hecke eigenforms which are non-ordinary for each $p\in S$. The proof is elementary and follows from a generalization of work of Choie, Kohnen a…