Related papers: On the Brun--Titchmarsh theorem. II

We prove that the Kloosterman sum $S(1,1;c)$ can change sign infinitely often as $c$ runs over squarefree moduli with at most 10 prime factors, which improves the previous results of E. Fouvry and Ph. Michel, J. Sivak-Fischler and K.…

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 proved a theorem that every large enough odd number can be represented as the sum of three almost equal Piatetski-Shapiro primes.

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

For a fixed prime $p$, the maximum coefficient (in absolute value) $M(p)$ of the cyclotomic polynomial $\Phi_{pqr}(x)$, where $r$ and $q$ are free primes satisfying $r>q>p$ exists. Sister Beiter conjectured in 1968 that $M(p)\le(p+1)/2$. In…

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$…

A new and exciting breakthrough due to Maynard establishes that there exist infinitely many pairs of distinct primes $p_1,p_2$ with $|p_1-p_2|\leq 600$ as a consequence of the Bombieri-Vinogradov Theorem. In this paper, we apply his general…

We introduce a new method to bound bilinear (Type II) sums of Kloosterman sums with composite moduli $c$, using Fourier analysis on $\mathrm{SL}_2(\mathbb{Z}/c\mathbb{Z})$ and an amplification argument with non-abelian characters. For sums…

In this paper we establish some new supercongruences motivated by the well-known fact $\lim_{n\to\infty}(1+1/n)^n=e$. Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{-1/(p+1)}k^{p+1}\equiv 0\ \pmod{p^5}\ \ \ \mbox{and}\ \ \…

Let p be an odd prime. Let F_p^* be the no-null part of the finite field of p elements. Let K=\Q(zeta) be a p-cyclotomic field and O_K be its ring of integers. Let pi be the prime ideal of K lying over p. Let sigma : zeta --> zeta^v be the…

We study the series s(n,x) which is the sum for k from 1 to n of the square of the sine of the product x Gamma(k)/k, where x is a variable. By Wilson's theorem we show that the integer part of s(n,x) for x = Pi/2 is the number of primes…

Let $t:\mathbb{F}_{p}\rightarrow\mathbb{C}$ be a complex valued function on $\mathbb{F}_{p}$. A classical problem in analytic number theory is to bound the maximum of the absolute value of the incomplete sum \[ M(t):=\max_{0\leq…

Let $\mathcal{K}(a)$ denote the Kloosterman sum on the finite field of order $2^n$. We give a simple characterization of $\mathcal{K}(a)$ modulo 16, in terms of the trace of $a$ and one other function. We also give a characterization of…

We give a short proof for an explicit upper bound on the proportion of permutations of a given prime order $p$, acting on a finite set of given size $n$, which is sharp for certain $n$ and $p$. Namely, we prove that if $n\equiv k\pmod{p}$…

We prove in particular that for any sufficiently large prime $p$ there is $1\le a<p$ such that all partial quotients of $a/p$ are bounded by $O(\log p/\log \log p)$. For composite denominators a similar result is obtained. This improves the…

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

We note an interesting and under-expressed fact from Chebyshev's initial bounding for the prime counting function, $\pi(x) := \# \{p \leq x : p \text{ prime}\},$ based upon a selection of fixed coefficients $d\in D$ to show $\psi(x) \asymp…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. Suppose that $a$ and $q$ are positive integers satisfying $(a,q)=1$. Denote by $\mathcal{P}_2(a,q)$ the least almost-prime…

In this paper, we prove that for any fixed $205/243<\gamma\leqslant1$, every sufficiently large $N$ satisfying $N\equiv 5 \pmod {24}$ can be represented as five squares of primes with one prime in $\mathcal{P}_\gamma$, which improves the…