Related papers: On primes represented by quartic polynomials on av…

Let $K=\mathbb{Q}(\omega)$ with $\omega$ the root of a degree $n$ monic irreducible polynomial $f\in\mathbb{Z}[X]$. We show the degree $n$ polynomial $N(\sum_{i=1}^{n-k}x_i\omega^{i-1})$ in $n-k$ variables formed by setting the final $k$…

We find an upper bound for the sum $\sum_{x<n\leq 2x}\textbf{1}_{\mathbb{P}}(n+h_{i_{1}})\cdots\textbf{1}_{\mathbb{P}}(n+h_{i_{m+1}})w_{n}$, where $(h_{i_{1}},...,h_{i_{m+1}})$ is any $(m+1)$-tuple of elements in the admissible set…

Suppose that $n$ is $0$ or $4$ modulo $6$. We show that there are infinitely many primes of the form $p^2 + nq^2$ with both $p$ and $q$ prime, and obtain an asymptotic for their number. In particular, when $n = 4$ we verify the `Gaussian…

We present a variety of prime-generating constructions that are based on sums of primes. The constructions come in all shapes and sizes, varying in the number of dimensions and number of generated primes. Our best result is a construction…

We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…

We establish an upper bound for the rank of every power of an arbitrary quadratic form. Specifically, for any $s\in\mathbb{N}$, we prove that the $s$-th power of a quadratic form of rank $n$ grows as $n^s$. Furthermore, we demonstrate that…

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

Let $K\geq 2$ be a natural number and $a_i,b_i\in\mathbb{Z}$ for $i=1,\ldots,K-1$. We use the large sieve to derive explicit upper bounds for the number of prime $k$-tuplets, i.e., for the number of primes $p\leq x$ for which all $a_ip+b_i$…

In our paper, we apply additive-combinatorial methods to study the distribution of the set of squares $\mathcal{R}$ in the prime field. We obtain the best upper bound on the number of gaps in $\mathcal{R}$ at the moment and generalize this…

This is a survey article on prime number races. Chebyshev noticed in the first half of the nineteenth century that for any given value of x, there always seem to be more primes of the form 4n+3 less than x then there are of the form 4n+1.…

Let $Q$ be a positive-definite quaternary quadratic form with prime discriminant. We give an explicit lower bound on the number of representations of a positive integer $n$ by $Q$. This problem is connected with deriving an upper bound on…

Let $x$ denote a sufficiently large integer. We show that the recent result of Grimmelt and Merikoski actually yields the largest prime factor of $n^2 +1$ is greater than $x^{1.317}$ infinitely often. As an application, we give a new upper…

We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$. Our main result shows that the primes are equidistributed for a fixed residue class over all moduli of size $x^{1/2+\delta}$ with a…

We bound from below the number of shifted primes p+s<x that have a divisor in a given interval (y,z]. Kevin Ford has obtained upper bounds of the expected order of magnitude on this quantity as well as lower bounds in a special case of the…

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…

We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

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…