In a recent work \cite{key-11}, A. Fish proved that if $E_{1}$ and $E_{2}$ are two subsets of $\mathbb{Z}$ of positive upper Banach density, then there exists $k\in\mathbb{Z}$ such that $k\cdot\mathbb{Z}\subset\left(E_{1}-E_{1}\right)\cdot\left(E_{2}-E_{2}\right).$ In this article we will show that a similar result is true for the set of primes $\mathbb{P}$ (which has density $0$). We will prove that there exists $k\in\mathbb{N}$ such that $k\cdot\mathbb{N}\subset\left(\mathbb{P}-\mathbb{P}\right)\cdot\left(\mathbb{P}-\mathbb{P}\right),$ where $\mathbb{P}-\mathbb{P}=\left\{ p-q:p>q\,\text{and}\,p,q\in\mathbb{P}\right\} .$
We show that the number of positive integers $n\leq N$ such that $\mathbb{Z}/(n^2+n+1)\mathbb{Z}$ contains a perfect difference set is asymptotically $N/\log{N}$.
In this paper, we study the hybrid problem of Hua's theorem and the Piatetski-Shapiro prime number theorem, and obtain results in this direction of the nonhomogeneous case $k=3$, which deepen the classical result of Hua.
Let $x$ be a positive integer. We give an asymptotic formula for the number of primes in the set $\{\fl{x/n}, 1 \le n \le x\}$ and give some related results.
Let [t] be the integral part of the real number t and let 1 P be the characteristic function of the primes. Denote by $π$ G (x) the number of primes in the floor function set G(x) := {[ x n ] : 1 n x} and by S 1 P (x) the number of primes in the sequence {[ x n ]} n 1. Very recently, Heyman proves
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).
In 1874, Mertens famously proved an asymptotic formula for the product $p/(p-1)$ over all primes $p$ up to $x$. On the other hand, one may expand Mertens' prime product into series over numbers $n$ with only small prime factors. It is natural to restrict such series to numbers $n$ with a fixed number $k$ of prime factors. In this article, we obtain formulae for these series for each $k$, which together dissect Mertens' original estimate. The proof is by elementary methods of a combinatorial flavor.
Let $\mathbb{F}_q$ be a finite field of order $q$ and $\mathcal{E}$ be a set in $\mathbb{F}_q^d$. The distance set of $\mathcal{E}$, denoted by $Δ(\mathcal{E})$, is the set of distinct distances determined by the pairs of points in $\mathcal{E}$. Very recently, Iosevich, Koh, and Parshall (2018) proved that if $|\mathcal{E}|\gg q^{d/2}$, then the quotient set of $Δ(\mathcal{E})$ satisfies \[\left\vert\frac{Δ(\mathcal{E})}{Δ(\mathcal{E})}\right\vert=\left\vert \left\lbrace\frac{a}{b}\colon a, b\in Δ(\mathcal{E}), b\ne 0\right\rbrace\right\vert\gg q.\] In this paper, we break the exponent $d/2$ …
A celebrated and deep result of Green and Tao states that the primes contain arbitrarily long arithmetic progressions. In this note I provide a straightforward argument demonstrating that the primes get arbitrarily close to arbitrarily long arithmetic progressions. The argument also applies to `large sets' in the sense of Erdős-Turán. The proof is short, completely self-contained, and aims to give a heuristic explanation of why the primes, and other large sets, possess arithmetic structure.
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…
Let $A \subset \mathbb{F}_p$ of size at most $p^{3/5}$. We show $$|A+A| + |AA| \gtrsim |A|^{6/5 + c},$$ for $c = 4/305$. Our main tools are the cartesian product point--line incidence theorem of Stevens and de Zeeuw and the theory of higher energies developed by the second author.
We establish an analog of the Hardy-Ramanujan inequality for counting members of sifted sets with a given number of distinct prime factors. In particular, we establish a bound for the number of shifted primes p+a below x with k distinct prime factors, uniformly for all positive integers k.
Let $f(x_1,\ldots,x_s)$ be a translation invariant indefinite quadratic form of integer coefficients with $s\ge 10$. Let $\mathcal{A}\subseteq \mathcal{P}\cap \{1,2,\ldots,X\}$. Let $X$ be sufficiently large. Subject to a rank condition, we prove that there exist distinct primes $p_1,\ldots,p_s\in \mathcal{A}$ such that $f(p_1,\ldots,p_s)=0$ as soon as $|\mathcal{A}|\ge \frac{X}{\log X} (\log\log X)^{-\frac{1}{80}}.$
We show that if the difference of two elements of a set $A \subseteq [N]$ is never one less than a prime number, then $|A| = O (N \exp (-c (\log N)^{1/3}))$ for some absolute constant $c>0$.
Let $\mathcal{P}$ denote the set of all primes. $P_{1},P_{2},P_{3}$ are three subsets of $\mathcal{P}$. Let $\underlineδ(P_{i})$ $(i=1,2,3)$ denote the lower density of $P_{i}$ in $\mathcal{P}$, respectively. It is proved that if $\underlineδ(P_{1})>5/8$, $\underlineδ(P_{2})\geq5/8$, and $\underlineδ(P_{3})\geq5/8$, then for every sufficiently large odd integer n, there exist $p_{i} \in P_{i}$ such that $n=p_{1}+p_{2}+p_{3}$. The condition is the best possible.
Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$ is the set of primes congruent to $r$ modulo $m$ (where $m$ and $r$ are relatively prime numbers), then this natural density is shown to be $0$.
Given disjoint subsets $T_1,\ldots,T_m$ of "not too large" primes up to $x$, we establish that for a random integer $n$ drawn from $[1,x]$, the $m$-dimensional vector enumerating the number of prime factors of $n$ from $T_1,\ldots,T_m$ converges to a vector of $m$ independent Poisson random variables. We give a specific rate of convergence using the Kubilius model of prime factors. We also show a universal upper bound of Poisson type when $T_1,\ldots,T_m$ are unrestricted, and apply this to the distribution of the number of prime factors from a set $T$ given that $n$ has $k$ total prime factor…
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).
The transference principle of Green and Tao enabled various authors to transfer Szemerédi's theorem on long arithmetic progressions in dense sets to various sparse sets of integers, mostly sparse sets of primes. In this paper, we provide a transference principle which applies to general affine-linear configurations of finite complexity. We illustrate the broad applicability of our transference principle with the case of almost twin primes, by which we mean either Chen primes or "bounded gap primes", as well as with the case of primes of the form $x^2+y^2+1$. Thus, we show that in these sets of…
Jacob's ladders, point of contact of the remainder in the prime-number law with the Fermat-Wiles theorem and multiplicative puzzles on some sets of integrals
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 establish estimates for the number of ways to represent any reduced residue class as a product of a prime and an integer free of small prime factors. Our best results is conditional on the Generalised Riemann hypothesis (GRH). As a corollary, we make progress on a conjecture of Erdös, Odlyzko and Sárközy.
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.
