On the distribution of modular square roots of primes

We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side length below $p^{1/2}$, which seems to be the limit of more general methods based on the bounds of exponential sums along varieties.

This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ a\geq 1$ and $ q\geq 1$ of opposite parity. For a large number $x\geq1$, an asymptotic result of the form $\sum_{n\leq x^{1/2},\, n \text{ odd}}\Lambda(qn^2+a)\gg qx^{1/2}/2\varphi(q)$ is achieved for $q\ll (\log x)^b$, where $ b\geq 0 $ is a constant.

Let a be a positive integer which is not a perfect h-th power with h greater than 1, and Q_a(x;4,j) be the set of primes p less than x such that the residual order of a(mod p) is congruent to j modulo 4. When j=0, 2, it is known that calculations of #Q_a(x;4,j) are simple, and we can get their natural densities unconditionally. On the contrary, when j=1, 3, the distribution properties of Q_a(x;4,j) are rather complicated. In this paper, which is a sequel of our previous paper...

We consider the uniform distribution of solutions $(x,y)$ to $xy=N \mod a$, and obtain a bound on the second moment of the number of solutions in squares of length approximately $a^{1/2}$. We use this to study a new factoring algorithm that factors $N=UV$ provably in $O(N^{1/3+\epsilon})$ time, and discuss the potential for improving the runtime to sub-exponential.

We prove asymptotic formulae for sums of the form $$ \sum_{n\in\mathbb{Z}^d\cap K}\prod_{i=1}^tF_i(\psi_i(n)), $$ where $K$ is a convex body, each $F_i$ is either the von Mangoldt function or the representation function of a quadratic form, and $\Psi=(\psi_1,\ldots,\psi_t)$ is a system of linear forms of finite complexity. When all the functions $F_i$ are equal to the von Mangoldt function, we recover a result of Green and Tao, while when they are all representation functions...

We investigate the density of square-free values of polynomials with large coefficients over the rational function field $\mathbb{F}_q[t]$. Some interesting questions answered as special cases of our results include the density of square-free polynomials in short intervals, and an asymptotic for the number of representations of a large polynomial $N$ as a sum of a small $k$-th power and a square-free polynomial.

In the present paper we obtain new upper bound estimates for the number of solutions of the congruence $$ x\equiv y r\pmod p;\quad x,y\in \mathbb{N},\quad x,y\le H,\quad r\in\cU, $$ for certain ranges of $H$ and $|\cU|$, where $\cU$ is a subset of the field of residue classes modulo $p$ having small multiplicative doubling. We then use this estimate to show that the number of solutions of the congruence $$ x^n\equiv \lambda\pmod p; \quad x\in \N, \quad L<x<L+p/n, $$ is at mos...

We establish limit laws for the distribution in small intervals of the roots of the quadratic congruence $\mu^2 \equiv D \bmod m$, with $D > 0$ square-free and $D\not\equiv 1 \bmod 4$. This is achieved by translating the problem to convergence of certain geodesic random line processes in the hyperbolic plane. This geometric interpretation allows us in particular to derive an explicit expression for the pair correlation density of the roots.

In this paper, we make a conjecture (conjecture 1) related to the Bateman-Horn conjecture and proceed to study the roots of $x^2+1$ and $x^2+2$ to prime moduli, assuming the truth of the Bateman-Horn conjecture and conjecture 1 and using the Erd\H{o}s-Turan-Koksma inequality.

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We likewise treat representations of shifted primes p-1 as sums of two almost prime squares. The methods involve a combination of analytic, automorphic and algebraic arguments to handle representations by restricted binary quadratic forms with a ...