Related papers: The large sieve for $2^{[O(n^{15/14+o(1)})]}$ modu…

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

We use the large sieve inequality for smooth numbers due to S. Drappeau, A. Granville and X. Shao (2017), together with some other arguments, to improve their bounds on the frequency of pairs $(q,\chi)$ of moduli $q$ and primitive…

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

Let $\theta $ be a Salem number and $P(x)$ a polynomial with integer coefficients. It is well-known that the sequence $(\theta^n)$ modulo 1 is dense but not uniformly distributed. In this article we discuss the sequence $(P(\theta^n))$…

The behaviour of Hecke polynomials modulo p has been the subject of some study. In this note we show that, if p is a prime, the set of integers N such that the Hecke polynomials T^{N,\chi}_{l,k} for all primes l, all weights k>1 and all…

In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number theorem for arithmetic progressions of the following kind. Let $\mathcal{S}$ be a set of pairwise coprime moduli $q\le x^{9/40}$. Then the…

We show that $$\sum_{\substack{p_n \in [x, 2x] \\ p_{n+1} - p_n \ge x^{1/2}}} (p_{n+1} - p_n) \ll x^{0.57+\epsilon}$$ and $$\sum_{\substack{p_n \in [x, 2x] \\ p_{n+1} - p_n \ge x^{0.45}}} (p_{n+1} - p_n) \ll x^{0.63+\epsilon},$$ where $p_n$…

We show that if a big set of integer points in [0,N]^d, d>1, occupies few residue classes mod p for many primes p, then it must essentially lie in the solution set of some polynomial equation of low degree. This answers a question of…

We use methods of combinatorial number theory to prove that, for each $n>1$ and any prime $p$, some homotopy group $\pi_i(SU(n))$ contains an element of order $p^{n-1+ord_p([n/p]!)}$, where $ord_p(m)$ denotes the largest integer $\alpha$…

We show that the sequence $(\alpha n)_{n\in \mathcal{B}}$ is uniformly distributed modulo 1, for every irrational $\alpha$, provided $\mathcal{B}$ belongs to a certain family of integer sequences, which includes the prime, almost prime,…

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\H{o}s implying that, for any function $\xi(n)$ tending to infinity with…

It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…

It is known that the M\"obius function in number theory is higher order oscillating. In this paper we show that there is another kind of higher order oscillating sequences in the form $(e^{2\pi i \alpha \beta^{n}g(\beta)})_{n\in \N}$, for a…

We obtain a new estimate for Kloosterman sum with primes $p\leqslant X$ to composite modulo $q$, that is, for the exponential sum of the type \[ \sum\limits_{p\leqslant X,\;p\,\nmid q}\exp{\biggl(\frac{2\pi…

Under fairly general conditions, we show that families of integer-valued polynomial-like multiplicative functions are uniformly distributed in coprime residue classes mod $p$, where $p$ is a growing prime (or nearly prime) modulus. This can…

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

In this paper, we prove the twin prime conjecture showing that \begin{align} \sum \limits_{\substack{p\leq x\\p,p+2\in \mathbb{P}}}1\geq (1+o(1))\frac{x}{2\mathcal{C}\log^2 x}\nonumber \end{align} where $\mathcal{C}:=\mathcal{C}(2)>0$ fixed…

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p\ge 5$ and $r\ge 2$, we prove that \begin{equation} \sum\limits_{\begin{smallmatrix}…

In this paper, we give a short and entirely elementary proof of the proposition ``For any positive integer $ N $, there exists a real number $ L $ such that for any real number $ x \geqq L $, there are at least $ N $ primes in the interval…

We prove an estimate for the large sieve with square moduli which improves a recent result of L. Zhao. Our method uses an idea of D. Wolke and some results from Fourier analysis.