Related papers: New observations on primitive roots modulo primes

We estimate character sums with n!, on average, and individually. These bounds are used to derive new results about various congruences modulo a prime p and obtain new information about the spacings between quadratic nonresidues modulo p.…

We derive, for all prime moduli p except those in a very thin set, an upper bound for the least prime primitive root (mod p) of order of magnitude a constant power of log p. The improvement over previous results, where the upper bound was…

Let $p\geq 2$ be a large prime, and let $N\gg ( \log p)^{1+\varepsilon}$. This note proves the existence of primitive roots in the short interval $[M,M+N]$, where $M \geq 2$ is a fixed number, and $ \varepsilon>0$ is a small number. In…

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…

Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…

Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p.…

Let $p$ be an odd prime. In the paper, by using the properties of Legendre polynomials we prove some congruences for $\sum_{k=0}^{\frac{p-1}2}\binom{2k}k^2m^{-k}\mod {p^2}$. In particular, we confirm several conjectures of Z.W. Sun. We also…

Let $p \geq 5$ be a prime and for $a, b \in \mathbb{F}_{p}$, let $E_{a,b}$ denote the elliptic curve over $\mathbb{F}_{p}$ with equation $y^2=x^3+a\,x + b$. As usual define the trace of Frobenius $a_{p,\,a,\,b}$ by \begin{equation*}…

Nagell proved that for each prime $p\equiv 1\pmod{3}$, $p > 7$, there is a prime $q<2p^{1/2}$ that is a cubic residue modulo $p$. Here we show that for each fixed $\epsilon > 0$, and each prime $p\equiv 1\pmod{3}$ with $p > p_0(\epsilon)$,…

In this paper, we pose lots of challenging conjectures on congruences for the sums involving binomial coefficients and Ap\'ery-like numbers modulo $p^3$, where $p$ is an odd prime.

Let $p$ be an odd prime. For $b,c\in\mathbb Z$, Sun introduced the determinant $$D_p(b,c)=\left|(i^2+bij+cj^2)^{p-2}\right|_{1\leqslant i,j \leqslant p-1},$$ and investigated the Legendre symbol $(\frac{D_p(b,c)}p)$. Recently Wu, She and Ni…

When using a Groebner basis to solve the highly symmetric system of algebraic equations defining the cyclic p-roots, one has the feeling that much of the advantage of computerized symbolic algebra over hand calculation is lost through the…

Given an integer $t\ge 1$, a rational number $g$ and a prime $p\equiv 1({\rm mod} t)$ we say that $g$ is a near-primitive root of index $t$ if $\nu_p(g)=0$, and $g$ is of order $(p-1)/t$ modulo $p$. In the case $g$ is not minus a square we…

Let $p>3$ be a prime. Euler numbers $E_{p-3}$ first appeared in H. S. Vandiver's work (1940) in connection with the first case of Fermat Last Theorem. Vandiver proved that $x^p+y^p=z^p$ has no solution for integers $x,y,z$ with…

In this paper we examine Grosswald's conjecture on $g(p)$, the least primitive root modulo $p$. Assuming the Generalized Riemann Hypothesis (GRH), and building on previous work by Cohen, Oliveira e Silva and Trudgian, we resolve Grosswald's…

We use modular symmetric designs to study the existence of Hadamard matrices modulo certain primes. We solve the $7$-modular and $11$-modular versions of the Hadamard conjecture for all but a finite number of cases. In doing so, we state a…

Let p be a prime = 3 (mod 4). A number of elegant number-theoretical properties of the sums T(p) = \sqrt{p}sum_{n=1}^{(p-1)/2} tan(n^2\pi/p) and C(p) = \sqrt{p}sum_{n=1}^{(p-1)/2} cot(n^2\pi/p) are proved. For example, T(p) equals p times…

For any odd prime number $p$, let $(\cdot|p)$ be the Legendre symbol, and let $n_1(p)<n_2(p)<\cdots$ be the sequence of positive nonresidues modulo $p$, i.e., $(n_k|p)=-1$ for each $k$. In 1957, Burgess showed that the upper bound…

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

In this paper, motivated by the work of Chapman, Vsemirnov and Sun et al., we investigate some arithmetic properties of the generalized Legendre matrices over finite fields. For example, letting $a_1,\cdots,a_{(q-1)/2}$ be all non-zero…