English
Related papers

Related papers: On the least square-free primitive root modulo $p$

200 papers

Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*,$ then we say that $g$ is a $t$-near primitive root modulo $p$. We point out the easy result that each primitive residue class contains a…

Number Theory · Mathematics 2019-11-13 Pieter Moree , Min Sha

Let $p=2n+1$ be an odd prime, and let $\zeta_{p^2-1}$ be a primitive $(p^2-1)$-th root of unity in the algebraic closure $\overline{\mathbb{Q}_p}$ of $\mathbb{Q}_p$. We let $g\in\mathbb{Z}_p[\zeta_{p^2-1}]$ be a primitive root modulo…

Number Theory · Mathematics 2020-02-05 Hai-Liang Wu

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

Number Theory · Mathematics 2023-12-19 N. A. Carella

Let $\delta(p)$ tend to zero arbitrarily slowly as $p\to\infty$. We exhibit an explicit set $\mathcal{S}$ of primes $p$, defined in terms of simple functions of the prime factors of $p-1$, for which the least primitive root of $p$ is $\le…

Number Theory · Mathematics 2024-10-08 Kevin Ford , Mikhail R. Gabdullin , Andrew Granville

Let $p$ be an odd prime, and define $$G_p(x)=\prod_{k=1}^{(p-1)/2}\left(x-e^{2\pi i k^2/p}\right).$$ In this paper we study values of $G_p(x)$ at roots of unity via Galois theory, and confirm some previous conjectures. For example, for any…

Number Theory · Mathematics 2026-05-12 Zhi-Wei Sun

Let f\in Z[x], deg(f)=3. Assume that f does not have repeated roots. Assume as well that, for every prime q, the inequality f(x)\not\equiv 0 mod q^2 has at least one solution in (Z/q^2 Z)^*. Then, under these two necessary conditions, there…

Number Theory · Mathematics 2014-07-21 H. A. Helfgott

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…

General Mathematics · Mathematics 2020-05-27 N. A. Carella

We propose a novel algorithm for finding square roots modulo p. Although there exists a direct formula to calculate square root of an element modulo prime (3 mod 4), but calculating square root modulo prime (1 mod 4) is non trivial.…

General Mathematics · Mathematics 2021-09-01 Rajeev Kumar

A polynomial $p\in\mathbb{R}[x]$ is a divisor of some polynomial $0\neq f\in\mathbb{R}[x]$ with non-negative coefficients if and only if $p$ does not have a positive real root. The lowest possible degree of such $f$ for a given $p$ is known…

Optimization and Control · Mathematics 2012-10-26 Tomáš Kepka , Miroslav Korbelář

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

Logic in Computer Science · Computer Science 2022-05-25 Ruben Gamboa , Woodrow Gamboa

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…

Number Theory · Mathematics 2020-08-27 Pieter Moree

A Lehmer number modulo a prime $p$ is an integer $a$ with $1 \leq a \leq p-1$ whose inverse $\bar{a}$ within the same range has opposite parity. Lehmer numbers that are also primitive roots have been discussed by Wang and Wang in an…

Number Theory · Mathematics 2017-12-13 Stephen D. Cohen , Tim Trudgian

Let $p\geq3$ be a large prime and let $n(p)\geq2$ denotes the least quadratic nonresidue modulo $p$. This note sharpens the standard upper bound of the least quadratic nonresidue from the unconditional upper bound $n(p)\ll…

General Mathematics · Mathematics 2025-10-10 N. A. Carella

Let $p=3n+1$ be a prime with $n\in\mathbb{N}=\{0,1,\cdots\}$, and let $g\in\mathbb{Z}$ be a primitive root modulo $p$. Let $0<a_1<\cdots<a_n<p$ be all the cubic residues modulo $p$ in the interval $(0,p)$. Then clearly the sequence $$a_1\…

Number Theory · Mathematics 2021-05-21 Hai-Liang Wu , Yue-Feng She

We prove that any prime $p$ satisfying $\phi(p-1)\leq (p-1)/4$ contains two consecutive quadratic non-residues modulo $p$ neither of which is a primitive root modulo $p$.

Number Theory · Mathematics 2017-10-16 Tamiru Jarso , Tim Trudgian

This note determines an effective asymptotic formula for the number of squarefree totients $p-1$ with a fixed primitive root $u\ne \pm 1, v^2$.

General Mathematics · Mathematics 2024-10-08 N. A. Carella

Let $E/\mathbb{Q}$ be an elliptic curve. For a prime $p$ of good reduction, let $r(E,p)$ be the smallest non-negative integer that gives the $x$-coordinate of a point of maximal order in the group $E(\mathbb{F}_p)$. We prove unconditionally…

Number Theory · Mathematics 2021-06-21 Steven Jin , Lawrence C. Washington

This paper is continuation of the paper "Primitive roots in quadratic field". We consider an analogue of Artin's primitive root conjecture for algebraic numbers which is not a unit in real quadratic fields. Given such an algebraic number,…

Number Theory · Mathematics 2007-05-23 Joseph Cohen

Although squaring integers is deterministic, squares modulo a prime, $p$, appear to be random. First, because they are all generated by the multiplicative linear congruential equation, $x_{i+1} = g^2 x_i \mod p$, where $x_0 = 1$ and $g$ is…

Applications · Statistics 2016-12-20 Roger Bilisoly

Let $p$ be an odd prime and let ${\mathbb F}_p$ denote the finite field with $p$ elements. Suppose that $g$ is a primitive root of ${\mathbb F}_p$. Define the permutation $\tau_g:\,{\mathcal H}_p\to{\mathcal H}_p$ by $$…

Number Theory · Mathematics 2018-10-30 Li-Yuan Wang , Hao Pan