English
Related papers

Related papers: Explicit upper bounds on the least primitive root

200 papers

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

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Number Theory · Mathematics 2022-01-19 Amit Ghosh , Kenneth Ward

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

Number Theory · Mathematics 2020-06-30 Komal Agrawal , Paul Pollack

A primitive root modulo an integer $n$ is the generator of the multiplicative group of integers modulo $n$. Gauss proved that for any prime number $p$ greater than $3$, the sum of its primitive roots is congruent to $1$ modulo $p$ while its…

Number Theory · Mathematics 2019-11-20 Hao Zhong , Tianxin Cai

We consider the sums of the form $$ S=\sum_{x=1}^{N} \exp\big((ax+b_1g_1^x+... +b_rg_r^x)/p \big) $$, where $p$ is prime and $g_1,..., g_r$ are primitive roots $\pmod p$. An almost forty years old problem of L. J. Mordell asks to find a…

Number Theory · Mathematics 2009-12-30 Cristian Cobeli

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

Number Theory · Mathematics 2025-05-14 Likun Xie

For any prime $p$, let $y(p)$ denote the smallest integer $y$ such that every reduced residue class $\pmod p$ is represented by the product of some subset of $\{1,\dots,y\}$. It is easy to see that $y(p)$ is at least as large as the…

Number Theory · Mathematics 2021-01-20 Greg Martin , Amir Parvardi

For an odd prime $p$, we say $f(X) \in {\mathbb F}_p[X]$ computes square roots in $\mathbb F_p$ if, for all nonzero perfect squares $a \in \mathbb F_p$, we have $f(a)^2 = a$. When $p \equiv 3 \mod 4$, it is well known that $f(X) =…

Number Theory · Mathematics 2024-01-24 Kiran Kedlaya , Swastik Kopparty

Fix $k$ a positive integer, and let $\ell$ be coprime to $k$. Let $p(k,\ell)$ denote the smallest prime equivalent to $\ell \pmod{k}$, and set $P(k)$ to be the maximum of all the $p(k,\ell)$. We seek lower bounds for $P(k)$. In particular,…

Number Theory · Mathematics 2016-12-23 Junxian Li , Kyle Pratt , George Shakan

We give an explicit version of a result due to D. Burgess. Let $\chi$ be a non-principal Dirichlet character modulo a prime $p$. We show that the maximum number of consecutive integers for which $\chi$ takes on a particular value is less…

Number Theory · Mathematics 2010-11-22 Kevin J. McGown

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

Let $g$ be a fixed Hecke cusp form for $\mathrm{SL}(2,\mathbb{Z})$ and $\chi$ be a primitive Dirichlet character of conductor $M$. The best known subconvex bound for $L(1/2,g\otimes \chi)$ is of Burgess strength. The bound was proved by a…

Number Theory · Mathematics 2020-02-10 Keshav Aggarwal , Roman Holowinsky , Yongxiao Lin , Qingfeng Sun

For a prime number $p$ and integer $x$ with $\gcd(x,p)=1$ let $\overline{x}$ denote the multiplicative inverse of $x$ modulo $p.$ In the present paper we are interested in the problem of distribution modulo $p$ of the sequence $$…

Number Theory · Mathematics 2023-04-18 Moubariz Z. Garaev , Igor E. Shparlinski

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

Number Theory · Mathematics 2023-01-10 Arnaud Bodin , Pierre Dèbes , Salah Najib

The celebrated Artin conjecture on primitive roots asserts that given any integer $g$ which is neither $-1$ nor a perfect square, there is an explicit constant $A(g)>0$ such that the number $\Pi(x;g)$ of primes $p\le x$ for which $g$ is a…

Number Theory · Mathematics 2025-09-16 Steve Fan , Paul Pollack

Linear upper bounds may be derived by imposing specific structural conditions on a generating set, such as additional constraints on ranks, eigenvalues, or the degree of the minimal polynomial of the generating matrices. This paper…

Rings and Algebras · Mathematics 2025-05-06 Chengjie Wang

For a prime number $p$, an integer $e\geq 2$ and a field $F$ containing a primitive $p^e$-th root of unity, the index of central simple $F$-algebras of exponent $p^e$ is bounded in terms of the $p$-symbol length of $F$. For a nonreal field…

Rings and Algebras · Mathematics 2024-02-13 Karim Johannes Becher , Fatma Kader Bingöl

Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Assume that $v_p(f(n))\ge s_1$ and $v_p(g(n))\ge s_2$ hold for all integers $n$ for some $s_1, s_2$ fixed non-negative integers. Let $S$ denote…

Number Theory · Mathematics 2021-11-12 Kristof Szabo

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

In this article we present a new technique to obtain a lower bound for the principal Dirichlet eigenvalue of a fully nonlinear elliptic operator. We ilustrate the construction of an appropriate radial function required to obtain the bound…

Analysis of PDEs · Mathematics 2019-06-25 Pablo Blanc