Related papers: On the Brun-Titchmarsh Theorem

Let $\chi$ be a real primitive character to the modulus $D$. It is proved that $$ L(1,\chi)\gg (\log D)^{-2022} $$ where the implied constant is absolute and effectively computable. In the proof, the lower bound for $L(1,\chi)$ is first…

Let \beta be a real number. Then for almost all irrational \alpha>0 (in the sense of Lebesgue measure) \limsup_{x\to\infty}\pi_{\alpha,\beta}^*(x)(\log x)^2/x>=1, where \pi_{\alpha,\beta}^*(x)={p<=x: both p and [\alpha p+\beta] are primes}.

In this paper, we solve a problem of Terence Tao. We prove that for any $K\geq 2$ and sufficiently large $N$, the number of primes $p$ between $N$ and $(1+\frac{1}{K})N$ such that $\mid kp+ja^{i}+l\mid$ is composite for all $1\leq a, |j|,…

By means of Peres-Schlag's method we prove the existence of real numbers $\alpha, \beta$ such that $$ \liminf_{q\to \infty} (q\log^2 q)||\alpha q|| ||\beta q|| > 0.

This paper is devoted to the theory of prime numbers. In this paper we first introduce the notion of a matrix of prime numbers. Then, in order to investigate the density of prime numbers in separate rows of the matrix under consideration,…

We show that the existence of arithmetic progressions with few primes, with a quantitative bound on "few", implies the existence of larger gaps between primes less than x than is currently known unconditionally. In particular, we derive…

We give simple new proofs of two well-known results for the Schr\"odinger operator: first, the Brunn--Minkowski inequality for Dirichlet eigenvalues and, second, the log-concavity of the first Dirichlet eigenfunction. Our proof of the first…

In this paper, we investigate the distribution of the imaginary parts of zeros near the real axis of Dirichlet $L$-functions associated to the quadratic characters $\chi_{p}(\cdot)=(\cdot |p)$ with $p$ a prime number. Assuming the…

For k greater than 1 and r different from 0, let pi^k_{2r}(x) denote the number of prime pairs (p,p^k+2r) with p not exceeding (large) x. By the Bateman-Horn conjecture, the function pi^k_{2r}(x) should be asymptotic to…

For any natural number $n$, let $X'_n$ be the set of primitive Dirichlet characters modulo $n$. We show that if the Riemann hypothesis is true, then the inequality $|X'_{2n_k}|\le C_2 e^{-\gamma} \phi(2n_k)/\log\log(2n_k)$ holds for all…

Prime number theorem asserts that (at large $x$) the prime counting function $\pi(x)$ is approximately the logarithmic integral $\mbox{li}(x)$. In the intermediate range, Riemann prime counting function $\mbox{Ri}^{(N)}(x)=\sum_{n=1}^N…

Let $\Gamma$ denote the modular group $SL(2,\Bbb Z)$ and $C_n(\Gamma)$ the number of congruence subgroups of $\Gamma$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log C_n(\Gamma)}{(\log n)^2/\log\log n} =…

We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…

The purpose of this paper is to generalize our earlier work on the logarithm of the Riemann zeta-function to linear combinations of logarithms of primitive Dirichlet $L$-functions with constant real coefficients. Under the assumption of…

It is proved that \[ \sum_{\chi \bmod q}N(\sigma , T, \chi) \lesssim_{\epsilon} (qT)^{7(1-\sigma)/3+\epsilon}, \] where $N(\sigma, T, \chi)$ denote the number of zeros $\rho = \beta + it$ of $L(s, \chi)$ in the rectangle $\sigma \leq \beta…

The prime number graph is the set of points $(n,p_n)$ where $p_n$ denotes the $n^{\rm th}$ prime. Let $L(n)$ be the minimum number of straight line segments needed to cover the first $n$ points in this set. Let $B(n)$ be the largest number…

In this article we prove that equation $\phi(x)=n$, for a fixed $n$, admits a finite number of solutions, we find the general form of these solutions, and we show that: if $x_0$ is a unique solution of this equation then $x_0$ is a product…

We show that there are infinitely many primes $p$ such that not only does $p + 2$ have at most two prime factors, but $p + 6$ also has a bounded number of prime divisors. This refines the well known result of Chen.

Let $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density…

We consider small solutions of quadratic congruences of the form $x_1^2+\alpha_2x_2^2+\alpha_3x_3^2\equiv 0 \bmod{q}$, where $q=p^m$ is an odd prime power. Here, $\alpha_2$ is arbitrary but fixed and $\alpha_3$ is variable, and we assume…