We study the problem of representing integers as sums of prime numbers from a fixed Beatty sequence $B_{α,β}$, where $α>1$ is irrational and of finite type.
We study sums with multiplicative functions that take values over a non-homogenous Beatty sequence. We then apply our result in a few special cases to obtain asymptotic formulas such as the number of integers in a Beatty sequence representable as a sum of two squares up to a given magnitude.
We estimate multiplicative character sums taken on the values of a non-homogeneous Beatty sequence $\{[αn + β] : n =1,2,... \}$, where $α,β\in\R$, and $α$ is irrational. Our bounds are nontrivial over the same short intervals for which the classical character sum estimates of Burgess have been established.
We prove an upper bound for the least prime in an irrational Beatty sequence. This result may be compared with Linnik's theorem on the least prime in an arithmetic progression.
Let $k \ge 2$ and $α_1, β_1, ..., α_k, β_k$ be reals such that the $α_i$'s are irrational and greater than 1. Suppose further that some ratio $α_i/α_j$ is irrational. We study the representations of an integer $n$ in the form $$ p_1 + p_2 + ... + p_k = n, $$ where $p_i$ is a prime from the Beatty sequence $$ \mathcal B_i = \left\{n \in \mathbb N : n = [ α_i m + β_i ] \text{for some} m \in \mathbb Z \right\}. $$
Let $α>1$ be irrational and of finite type, $β\in\mathbb{R}$. In this paper, it is proved that for $R\geqslant13$ and any fixed $c\in(1,c_R)$, there exist infinitely many primes in the intersection of Beatty sequence $\mathcal{B}_{α,β}$ and $\lfloor n^c\rfloor$, where $c_R$ is an explicit constant depending on $R$ herein, $n$ is a natural number with at most $R$ prime factors, counted with multiplicity.
Let $α,β$ be real numbers such that $α>1$ is irrational and of finite type, and let $c$ be a real number in the range $1<c<\frac{14}{13}$. In this paper, it is shown that there are infinitely many Piatetski-Shapiro primes $p = \left\lfloor n^c \right\rfloor$ in the non-homogenous Beatty sequence $\big(\left\lfloorαm+β\right\rfloor\big)_{m=1}^\infty$.
We study the prime numbers that lie in Beatty sequences of the form $\lfloor αn + β\rfloor$ and have prescribed algebraic splitting conditions. We prove that the density of primes in both a fixed Beatty sequence and a Chebotarev class of some Galois extension is precisely the product of the densities $α^{-1}\cdot\frac{|C|}{|G|}$. Moreover, we show that the primes in the intersection of these sets satisfy a Bombieri--Vinogradov type theorem. This allows us to prove the existence of bounded gaps for such primes. As a final application, we prove a common generalization of the aforementioned bound…
Suppose that $α_1, α_2,β_1, β_2 \in\mathbb{R}$. Let $α_1, α_2 > 1$ be irrational and of finite type such that $1, α_1^{-1}, α_2^{-1}$ are linearly independent over $\mathbb{Q}$. Let $c$ be a real number in the range $1 < c < 12/11$. In this paper, it is proved that there exist infinitely many primes in the intersection of Beatty sequences $\mathcal{B}_{α_1,β_1} = \lfloorα_1 n + β_1\rfloor, \mathcal{B}_{α_2, β_2} = \lfloorα_2 n + β_2\rfloor$ and the Piatetski-Shapiro sequence $\mathscr{N}^{(c)} = \lfloor n^c\rfloor$. Moreover, we also give a sketch proof of Piatetski-Shapiro primes in the inter…
For a polynomial $g(x)$ of deg $k \geq 2$ with integer coefficients and positive integer leading coefficient, we prove an upper bound for the least prime $p$ such that $g(p)$ is in non-homogeneous Beatty sequence $\lbrace \lfloor αn+β\rfloor : n=1,2,3, \dots \rbrace$, where $α, β\in \mathbb{R}$ with $α>1$ is irrational and we prove an asymptotic formula for the number of primes $p$ such that $g(p)=\lfloor αn+β\rfloor.$ Next we obtain an asymptotic formula for number of primes $p$ of the form $p=\lfloor αn+β\rfloor$ which also satisfies $p \equiv f \pmod d$ where $f, d$ are integers with $1\leq…
Fix irrational numbers $α,\hatα>1$ of finite type and real numbers $β,\hatβ\ge 0$, and let $B$ and $\hat B$ be the Beatty sequences $$ B:=(\lfloorαm+β\rfloor)_{m\ge 1}\quad\text{and}\quad\hat B:=(\lfloor\hatαm+\hatβ\rfloor)_{m\ge 1}. $$ In this note, we study the distribution of pairs $(p,p^\sharp)$ of consecutive primes for which $p\in B$ and $p^\sharp\in\hat B$. Under a strong (but widely accepted) form of the Hardy-Littlewood conjectures, we show that $$ \big|\{p\le x:p\in B\text{ and }p^\sharp\in\hat B\}\big|=(α\hatα)^{-1}π(x)+O\big(x(\log x)^{-3/2+ε}\big), $$ where $π(x)$ is the prime cou…
A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[αn]+1$, where $1<α<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical results about the distribution of fractional parts of irrational multiples of primes in an arithmetic progression immediately imply that this conjecture holds in a much more precise asymptotic form. Motivated by this observation, we give an asymptotic formula for the number of primes $p=q[αn+β]+a$ with $n\le N$, where $α,β$ are real numbers such that $α$ is positive a…
Integer sequences of the form $\lfloor n^c\rfloor$, where $1<c<2$, can be locally approximated by sequences of the form $\lfloor nα+β\rfloor$ in a very good way. Following this approach, we are led to an estimate of the difference \[\sum_{n\leq x}φ\left(\lfloor n^c\rfloor\right)-\frac 1c\sum_{n\leq x^c}φ(n)n^{\frac 1c-1},\] which measures the deviation of the mean value of $φ$ on the subsequence $\lfloor n^c\rfloor$ from the expected value, by an expression involving exponential sums. As an application we prove that for $1<c\leq 1.42$ the subsequence of the Thue-Morse sequence indexed by $\lfl…
We generalize results of Alladi, Dawsey, and Sweeting and Woo for Chebotarev densities to general densities of sets of primes. We show that if $K$ is a number field and $S$ is any set of prime ideals with natural density $δ(S)$ within the primes, then \[ -\lim_{X \to \infty}\sum_{\substack{2 \le \operatorname{N}(\mathfrak{a})\le X\\ \mathfrak{a} \in D(K,S)}}\frac{μ(\mathfrak{a})}{\operatorname{N}(\mathfrak{a})} = δ(S), \] where $μ(\mathfrak{a})$ is the generalized Möbius function and $D(K,S)$ is the set of integral ideals $ \mathfrak{a} \subseteq \mathcal{O}_K$ with unique prime divisor of min…
We obtain a nontrivial bound for cancellations between the Kloosterman sums modulo a large prime power with a prime argument running over very short interval, which in turn is based on a new estimate on bilinear sums of Kloosterman sums. These results are analogues of those obtained by various authors for Kloosterman sums modulo a prime. However the underlying technique is different and allows us to obtain nontrivial results starting from much shorter ranges.
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.
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.
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.
This work gives a general approach to the determination of the asymptotic behavior of the sums of functions of primes based on the distribution of primes. It refines the estimate of the remainder term of the asymptotic expansion of the sums of functions of primes. Also, the necessary and sufficient conditions for the existence of these asymptotics are proved in the paper.
In this work we consider sums of primes that converging very slow. We set as a base, a reformulation of analytic prime number theorem and we use the values of Riemann Zeta function for the approximation. We also give the truncation error of these approximations
In this paper, we establish a theorem of Bombieri -- Vinogradov type for exponential sums over Piatetski-Shapiro primes $p= [n^{1/γ}]$ with $\frac{865}{886}<γ< 1$.
In this note we study Kloosterman sums twisted by a multiplicative characters modulo a prime power. We show, by an elementary calculation, that these sums become equidistributed on the real line with respect to a suitable measure.
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.
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.
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 .
We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression. Based on this distribution, a general formula was obtained for the asymptotic estimate of the sums of functions of primes, and also asymptotics was found for the sums of various functions of primes on a geometric progression. Several assertions about asymptotics of sums of functions of prime numbers on a geometric progression are proved. Necessary and sufficien…
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.
Under the assumption of the Riemann Hypothesis (RH), we prove explicit quantitative relations between hypothetical error terms in the asymptotic formulae for truncated mean-square average of exponential sums over primes and in the mean-square of primes in short intervals. We also remark that such relations are connected with a more precise form of Montgomery's pair-correlation conjecture.
In this paper we study quadratic forms which are universal when restricted to almost prime inputs, establishing finiteness theorems akin to the Conway--Schneeberger 15 theorem.
We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.
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.
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.
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 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 study the properties of certain graphs involving the sums of primes. Their structure largely turns out to relate to the distribution of prime gaps and can be roughly seen in Cramér's model as well. We also discuss generalizations to the Gaussian integers.
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.
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…
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.
Corentin Perret-Gentil proved, under some very general conditions, that short sums of $\ell$-adic trace functions over finite fields of varying center converges in law to a Gaussian random variable or vector. The main inputs are P.~Deligne's equidistribution theorem, N.~Katz' works and the results surveyed in \cite{MR3338119}. In particular, this applies to $2$-dimensional Kloosterman sums $\mathsf{Kl}_{2,\mathbb{F}_q}$ studied by N.~Katz in \cite{MR955052} and in \cite{MR1081536} when the field $\mathbb{F}_q$ gets large. \par This article considers the case of short sums of normalized classic…
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.
For arbitrary $c_0>0$, if $A$ is a subset of the primes less than $x$ with cardinality $δx (\log x)^{-1}$ with $δ\geq (\log x)^{-c_0}$, then there exists a positive constant $c$ such that the cardinality of $A+A$ is larger than $c\, δx (\log\log x)^{-1}$.