Related papers: Quadratic Non-residues in Short Intervals

It has been conjectured by Sarkozy that with finitely many exceptions, the set of quadratic residues modulo a prime $p$ cannot be represented as a sumset $\{a+b\colon a\in A, b\in B\}$ with non-singleton sets $A,B\subset F_p$. The case…

Define a natural number $n$ as a \textit{square-full} integer if for every prime $p$ such that $p|n$, we have $p^2|n$. In this paper, we establish an upper bound on the variance of square-full integers in short intervals of an expected…

Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…

Let $p$ be a large odd prime, let $x=\log p)(\log\log p)^{3+\varepsilon}$ and let $q\ll\log\log p$ be an integer, where $\varepsilon>0$ is a small number. This note proves the existence of small prime quadratic residues and small prime…

Let $Q(x,y)$ be a quadratic form with discriminant $D\neq 0$. We obtain non trivial upper bound estimates for the number of solutions of the congruence $Q(x,y)\equiv\lambda \pmod{p}$, where $p$ is a prime and $x,y$ lie in certain intervals…

We obtain a lower bound for \[ \#\{x/2< p_{n}\leq x:\ p_n \equiv\ldots\equiv p_{n+m}\equiv a\text{ (mod $q$)},\ p_{n+m} - p_{n}\leq y\}, \] where $p_{n}$ is the $n^{\text{th}}$ prime.

We prove that the set of normalized differences between primes, defined as $S = \{(p-q)/(p+q) : p > q \text{ are primes}\}$, is dense in the open unit interval $(0,1)$. Our proof provides an explicit construction algorithm with quantitative…

We study the distribution of spacings between squares modulo q as the number of prime divisors of q tends to infinity. In an earlier paper Kurlberg and Rudnick proved that the spacing distribution for square free q is Poissonian, this paper…

Suppose that an infinite set $A$ occupies at most $\frac{1}{2}(p+1)$ residue classes modulo $p$, for every sufficiently large prime $p$. The squares, or more generally the integer values of any quadratic, are an example of such a set. By…

We prove that the sequence $n!\,(\bmod\,p)$ occupies at least $\sqrt{\frac{3}{2}N}$ residue classes in the short interval $H\le n \le H+N$ and $N\gg p^{\frac{1}{4}}$ improving previously known trivial bound $\sqrt{N}.$ In the other…

Let $q$ be a power of a prime $p$, let $k$ be a nontrivial divisor of $q-1$ and write $e=(q-1)/k$. We study upper bounds for cyclotomic numbers $(a,b)$ of order $e$ over the finite field $\mathbb{F}_q$. A general result of our study is that…

For a polynomial $g(x)$ of deg $k \geq 2$ with integer coefficients and positive integer leading coefficient, we prove an upper bound for the least prime $p$ such that $g(p)$ is in non-homogeneous Beatty sequence $\lbrace \lfloor \alpha…

Let $q$ be an odd prime and $k$ be a natural number. We show that a finite subset of integers $S$ that does not contain any perfect $q^{th}$ power, contains a $q^{th}$ power residue modulo almost every natural numbers $N$ with at most $k$…

Let $q > 2$ be a prime number and define $\lambda_q := \left( \frac{\tau}{q} \right)$ where $\tau(n)$ is the number of divisors of $n$ and $\left( \frac{\cdot}{q} \right)$ is the Legendre symbol. When $\tau(n)$ is a quadratic residue modulo…

Let $q\ge 3$ be a non-exceptional modulus $q\ge3$, and let $a$ be a positive integer coprime with $q$. For any $\epsilon>0$, there exists $\alpha>0$ (computable), such that for all $x\ge \alpha (\log q)^2$, the interval $\left[…

We study the equidistribution of multiplicatively defined sets, such as the squarefree integers, quadratic non-residues or primitive roots, in sets which are described in an additive way, such as sumsets or Hilbert cubes. In particular, we…

By some extremely simple arguments, we point out the following: (i) If n is the least positive k-th power non-residue modulo a positive integer m, then the greatest number of consecutive k-th power residues mod m is smaller than m/n. (ii)…

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

For $m,q \in \mathbb{N}$, we call an $m$-tuple $(a_1,\ldots,a_m) \in \prod_{i=1}^m (\mathbb{Z}/q\mathbb{Z})^\times$ good if there are infinitely many consecutive primes $p_1,\ldots,p_m$ satisfying $p_i \equiv a_i \pmod{q}$ for all $i$. We…

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…