Related papers: Lehmer numbers and primitive roots modulo a prime

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,…

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\…

We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \sqrt{e})+ \epsilon}$, and we give some…

$ $The aim of this thesis is to lower the bound on square-free primitive roots modulo primes. Let $g^{\Box}(p)$ be the least square-free primitive root modulo $p$. We have proven the following two theorems. Theorem 0.1. $$g^{\Box}(p) <…

We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…

Let $q>2$ be an odd integer. For each integer $x$ with $0<x<q$ and $(q,x)= 1$, we know that there exists one and only one $\bar{x}$ with $0<\bar{x}<q$ such that $x\bar{x}\equiv1(\bmod q)$. A Lehmer number is defined to be any integer $a$…

A prime number $p$ is said to be a Wolstenholme prime if it satisfies the congruence ${2p-1\choose p-1} \equiv 1 \,\,(\bmod{\,\,p^4})$. For such a prime $p$, we establish the expression for ${2p-1\choose p-1}\,\,(\bmod{\,\,p^8})$ given in…

Let $v\geq 2$ be a fixed integer, and let $x \geq 1$ and $z \geq x$ be large numbers. The exact asymptotic formula for the number of Wieferich primes $p$ such that $ v^{p-1} \equiv 1 \bmod p^2$ in the short interval $[x,x+z]$ is proposed in…

Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…

The behaviour of Hecke polynomials modulo p has been the subject of some study. In this note we show that, if p is a prime, the set of integers N such that the Hecke polynomials T^{N,\chi}_{l,k} for all primes l, all weights k>1 and all…

In this paper, we introduce and study a variant of Kummer's notion of (ir)regularity of primes which we call G-irregularity. It is based on Genocchi numbers $G_n$, rather than Bernoulli number $B_n.$ We say that an odd prime $p$ is…

Grosswald's conjecture is that $g(p)$, the least primitive root modulo $p$, satisfies $g(p) \leq \sqrt{p} - 2$ for all $p>409$. We make progress towards this conjecture by proving that $g(p) \leq \sqrt{p} -2$ for all $409<p< 2.5\times…

Let $p>1$ be a large prime number and let $x=O((\log p)^2(\log\log p)^5$ be a real number. It is proved that the least consecutive pair of primitive roots $u\ne\pm1, v^2$ and $u+1$ satisfies the upper bound $u\ll x$ in the prime field…

Let $p$ be an odd prime, let $N$ be a prime with $N \equiv 1 \pmod{p}$, and let $\zeta_p$ be a primitive $p$-th root of unity. We study the $p$-rank of the class group of $\mathbb{Q}(\zeta_p, N^{1/p})$ using Galois cohomological methods and…

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 N and p be two prime numbers > 3 such that p divides N-1. We estimate the p-rank of the class group of Q(N^(1/p)) in terms of the discrete logarithm, with values un F_p, of certain units. Using the Gross--Koblitz formula and identities…

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…

Let $p\equiv 1\,(\mathrm{mod}\,3)$ be a prime and denote by $\zeta_3$ a primitive third root of unity. Recently, Lemmermeyer presented a conjecture about $3$-class groups of pure cubic fields $L=\mathbb{Q}(\sqrt[3]{p})$ and of their normal…

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 $$…

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…