Results 11 to 20 of about 24,946 (242)
Restriction theory of the Selberg sieve, with applications [PDF]
The Selberg sieve provides majorants for certain arithmetic sequences, such as the primes and the twin primes. We prove an L^2-L^p restriction theorem for majorants of this type.
Green, Ben, Tao, Terence
core +4 more sources
The ternary Goldbach problem [PDF]
The ternary Goldbach conjecture, or three-primes problem, states that every odd number $n$ greater than $5$ can be written as the sum of three primes. The conjecture, posed in 1742, remained unsolved until now, in spite of great progress in the twentieth
Helfgott, Harald Andrés
core +3 more sources
On the Distribution of Atkin and Elkies Primes [PDF]
Given an elliptic curve E over a finite field F_q of q elements, we say that an odd prime ell not dividing q is an Elkies prime for E if t_E^2 - 4q is a square modulo ell, where t_E = q+1 - #E(F_q) and #E(F_q) is the number of F_q-rational points on E ...
Shparlinski, Igor E. +1 more
core +2 more sources
Exponential Sums Over Primes in an Arithmetic Progression [PDF]
In 1979 A. F. Lavrik obtained some estimates for exponential sums over primes in arithmetic progressions by an analytic method. In the present paper we give an estimate for the same sums, comparable with Lavrik’s estimate, by means of elementary methods like Vaughan’s identity.
A. BALOG, PERELLI, ALBERTO
openaire +2 more sources
On Sums of Powers of Almost Equal Primes [PDF]
We investigate the Waring-Goldbach problem of representing a positive integer $n$ as the sum of $s$ $k$th powers of almost equal prime numbers. Define $s_k=2k(k-1)$ when $k\ge 3$, and put $s_2=6$.
Wei, Bin, Wooley, Trevor D.
core +5 more sources
Primes in short arithmetic progressions
We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes.
Schlage-Puchta, Jan-Christoph
core +1 more source
New proof and generalization of some results on translated sums over k-almost primes
A sequence $\mathcal{A}$ of strictly positive integers is said to be primitive if none of its terms divides the others, Erdős conjectured that the sum $f(\mathcal{A},0)\le f(\mathbb{N}_{1},0),$ where $\mathbb{N}_{1}$ is the sequence of prime numbers and $
Laib, Ilias
doaj +1 more source
Exterior powers in Iwasawa theory
The Iwasawa theory of CM fields has traditionally concerned Iwasawa modules that are abelian pro-p Galois groups with ramification allowed at a maximal set of primes over p such that the module is torsion.
Bleher, F. +5 more
core
On Erdős sums of almost primes
In 1935, Erdős proved that the sums $f_k=\sum _n 1/(n\log n)$, over integers $n$ with exactly $k$ prime factors, are bounded by an absolute constant, and in 1993 Zhang proved that $f_k$ is maximized by the prime sum $f_1=\sum _p 1/(p\log p)$.
Gorodetsky, Ofir +2 more
doaj +1 more source
Real exponential sums over primes and prime gaps
We prove that given $λ\in \R$ such that $0 < λ< 1$, then $π(x + x^λ) - π(x) \sim \displaystyle \frac{x^λ}{\log(x)}$. This solves a long-standing problem concerning the existence of primes in short intervals. In particular, we give a positive answer (for all sufficiently large number) to some old conjectures about prime numbers, such as Legendre's
openaire +2 more sources

