English
Related papers

Related papers: On the generalization of Golomb's conjecture

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

Let $n$ be a positive integer and let $C_n$ be the cycle indicator of the symmetric group $S_n$. Carlitz proved that if $p$ is a prime, and if $r$ is a non negative integer, then we have the congruence $C_{r+np}\equiv (X_1^p-X_p)^nC_r…

Number Theory · Mathematics 2023-06-22 Abdelaziz Bellagh , Assia Oulebsir

E. Artin conjectured that any integer $a >1$ which is not a perfect square is a primitive root modulo $p$ for infinitely many primes $p.$ Let $f_a(p)$ be the multiplicative order of the non-square integer $a$ modulo the prime $p.$ M. R.…

Number Theory · Mathematics 2021-05-31 Sankar Sitaraman

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

In this paper, we prove that for any odd prime $p$ and for any $p$-integer $\alpha $,we have $ \binom{\alpha p-1}{p-1}\equiv 1-\alpha (\alpha -1)(\alpha ^{2}-\alpha -1)p\sum_{k=1}^{p-1}\frac{1}{k}+\alpha ^{2} (\alpha-1)^{2}p^{2}\sum_{1\leq…

Combinatorics · Mathematics 2016-07-05 Farid Bencherif , Rachid Boumahdi

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

Number Theory · Mathematics 2022-01-27 Yong-Gao Chen , Yuchen Ding

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

We consider a modification of the classical number theoretic question about the gaps between consecutive primitive roots modulo a prime $p$, which by the well-known result of Burgess are known to be at most $p^{1/4+o(1)}$. Here we measure…

Number Theory · Mathematics 2012-07-05 Rainer Dietmann , Christian Elsholtz , Igor E. Shparlinski

Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…

Number Theory · Mathematics 2012-03-06 Lior Bary-Soroker , Moshe Jarden

A classic question in analytic number theory is to find asymptotics for $\sigma_{k}(x)$ and $\pi_{k}(x)$, the number of integers $n\leq x$ with exactly $k$ prime factors, where $\pi_{k}(x)$ has the added constraint that all the factors are…

Number Theory · Mathematics 2023-03-13 Eric Naslund

A set of natural numbers $A$ is called primitive if no element of $A$ divides any other. Let $\Omega(n)$ be the number of prime divisors of $n$ counted with multiplicity. Let $f_z(A) = \sum_{a \in A}\frac{z^{\Omega(a)}}{a (\log a)^z}$,…

Number Theory · Mathematics 2024-06-11 Petr Kucheriaviy

Let $p>2$ be prime and $g$ a primitive root modulo $p$. We present an argument for the fact that discrete logarithms of the numbers in any arithmetic progression are uniformly distributed in $[1,p]$ and raise some questions on the subject.

Number Theory · Mathematics 2008-11-27 Cristian Cobeli

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

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

For a given monic integral polynomial $f(x)$ of degree $n$, we define local roots $r_i$ of $f(x)$ for a completely decomposable prime $p$ by $r_i \in \mathbb{Z}$, $f(r_i) \equiv 0 \bmod p$ and $0 \le r_1 \le r_2 \le \dots \le r_n < p$. With…

Number Theory · Mathematics 2024-09-05 Yoshiyuki Kitaoka

In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} Z(p^{r})\equiv-2p^{r-1}B_{p-3} ~(\bmod ~ p^{r}), \end{equation*} where $…

Number Theory · Mathematics 2016-11-29 Tianxin Cai , Zhongyan Shen , Lirui Jia

A well-known conjecture of Gilbreath, and independently Proth from the 1800s, states that if $a_{0,n} = p_n$ denotes the $n^{\text{th}}$ prime number and $a_{i,n} = |a_{i-1,n}-a_{i-1,n+1}|$ for $i, n \ge 1$, then $a_{i,1} = 1$ for all $i…

Combinatorics · Mathematics 2022-01-12 Zachary Chase

We prove that, for almost all $r \leq N^{1/2}/\log^{O(1)}N$, for any given $b_1 \mod r$ with $(b_1, r) = 1$, and for almost all $b_2 \mod r$ with $(b_2, r) = 1$, we have that almost all natural numbers $2n \leq N$ with $2n \equiv b_1 + b_2…

Number Theory · Mathematics 2021-06-03 Juho Salmensuu

Let $p>1$ be a large prime number, let $q=O(\log\log p)$ and let $1\leq a<q$ be a pair of relatively prime integers. It is proved that there is a prime primitive root $u\ll (\log p)(\log \log p)^5$ such that $u\equiv a\bmod q$ in the prime…

General Mathematics · Mathematics 2025-09-25 N. A. Carella

We consider an analogue of Artin's primitive root conjecture for units in real quadratic fields. Given such a nontrivial unit, for a rational prime p which is inert in the field the maximal order of the unit modulo p is p+1. An extension of…

Number Theory · Mathematics 2007-05-23 Joseph Cohen