Related papers: Consecutive primes and Legendre symbols
Let $p>3$ be a prime, and let $(\frac{\cdot}p)$ be the Legendre symbol. Let $b\in\mathbb Z$ and $\varepsilon\in\{\pm 1\}$. We mainly prove that $$\left|\left\{N_p(a,b):\ 1<a<p\ \text{and}\ \left(\frac…
Suppose that $p$ is an odd prime and $\genfrac{(}{)}{}{}{\cdot}{p}$ denotes the Legendre symbol modulo $p$. If $p$ is has the form $p= n^2+1$ then one easily verifies that $\genfrac{(}{)}{}{}{a}{p} = \genfrac{(}{)}{}{}{-a}{p}$ for all $a\in…
Let $p$ be a prime and ${\mathfrak P}_p$ the set of positive integers which are prime to $p$. Recently, Wang and Cai proved that for every positive integer $r$ and prime $p>2$ $$ \sum_{\substack{i+j+k=p^r\\ i,j,k\in{\mathfrak P}_p}}…
Let $p$ be a prime number and $\left(\frac{\cdot}{p}\right)$ be the Legendre symbol modulo $p$. The \emph{Legendre path} attached to $p$ is the polygonal path whose vertices are the normalized character sums $\frac{1}{\sqrt{p}} \sum_{n\leq…
Let $p$ be a sufficiently large prime number, $r$ be any given positive integer. Suppose that $a_1,\,\dots,\,a_r$ are pairwise distinct and not zero modulo $p$. Let $N(a_1,\,\dots,\,a_r;\,p)$ denote the number of…
The evaluations of determinants with Legendre symbol entries have close relation with character sums over finite fields. Recently, Sun posed some conjectures on this topic. In this paper, we prove some conjectures of Sun and also study some…
A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…
Let $n\in\mathbb{Z}^+$. Is it true that every sequence of $n$ consecutive integers greater than $n^2$ and smaller than $(n+1)^2$ contains at least one prime number? In this paper we show that this is actually the case for every $n \leq…
Let $x\geq 1$ be a large number, and let $1 \leq a <q $ be integers such that $\gcd(a,q)=1$ and $q=O(\log^c)$ with $c>0$ constant. This note proves that the counting function for the number of primes $p \in \{p=qn+a: n \geq1 \}$ with a…
We prove that, for any prime $p$ and positive integer $r$ with $p^r>2$, the number of multinomial coefficients such that $$ {k\choose k_1,k_2,\ldots,k_n}=p^r,\quad \text{and}\quad k_1+2k_2+\cdots+nk_n=n, $$ is given by $$…
For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…
Let $P^+(n)$ denote the largest prime factor of the integer $n$ and $P_y^+(n)$ denote the largest prime factor $p$ of $n$ which satisfies $p\leqslant y$. In this paper, firstly we show that the triple consecutive integers with the two…
Legendre's conjecture states that there is a prime number between n^2 and (n+1)^2 for every positive integer n. We consider the following question : for all integer n>1 and a fixed integer k<=n does there exist a prime number such that kn <…
In this paper, we prove a conjecture of the second author by evaluating the determinant $$\det\left[x+\left(\frac{i-j}p\right)+\left(\frac ip\right)y+\left(\frac jp\right)z+\left(\frac{ij}p\right)w\right]_{0\le i,j\le(p-3)/2}$$ for any odd…
We prove that it is always possible to find a permutation $p$ on the set $\{1,...,n\}$ such that $c+p(c)$ is prime for all $c \in \{1,...,n\}.$
Let the numbers $\alpha_n,\beta_n$ and $\gamma_n$ denote \begin{align*} \alpha_n=\sum_{k=0}^{n-1}{2k\choose k},\quad \beta_n=\sum_{k=0}^{n-1}{2k\choose k}\frac{1}{k+1}\quad\text{and}\quad \gamma_n=\sum_{k=0}^{n-1}{2k\choose…
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…
Given an integer $k$, define $C_k$ as the set of integers $n > \max(k,0)$ such that $a^{n-k+1} \equiv a \pmod{n}$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient…
In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…
The world of primes has many gaps between evidence and theorems. Here, we review Legendre's conjecture on primes between consecutive squares and recent progress on the weaker question of primes between consecutive larger powers. Assuming…