Related papers: Least Prime Primitive Roots

Let $p$ be a prime, and let $k,n,m,n_0$ and $m_0$ be nonnegative integers such that $k\ge 1$, and $_0$ and $m_0$ are both less than $p$. K. Davis and W. Webb established that for a prime $p\ge 5$ the following variation of Lucas' Theorem…

In this paper, we show a new upper bound of prime gaps, that is the gap between a prime number and its consecutive prime number. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than…

Let $\mathcal{P}$ be a subset of primes and for each prime $p\in \mathcal{P}$, consider a subset $\mathcal{L}_p$ of $\mathbb{Z}/p\mathbb{Z}$. We provide restriction estimates with integers $\leq N$ sifted by…

We give a short proof that the limsup of the p-th root of the modulus of the p-th moment of a sequence of complex numbers is equal to the modulus of the maximum of the sequence.This strengthens known results, and provides an analog to a…

We study the complexity of optimizing highly smooth convex functions. For a positive integer $p$, we want to find an $\epsilon$-approximate minimum of a convex function $f$, given oracle access to the function and its first $p$ derivatives,…

For a measure on a subset of the complex plane we consider $L^p$-optimal weighted polynomials, namely, monic polynomials of degree $n$ with a varying weight of the form $w^n = {\rm e}^{-n V}$ which minimize the $L^p$-norms, $1 \leq p \leq…

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…

Let $G$ be a finite (not necessarily abelian) group and let $p=p(G)$ be the smallest prime number dividing $|G|$. We prove that $d(G)\leq \frac{|G|}{p}+9p^2-10p$, where $d(G)$ denotes the small Davenport constant of $G$ which is defined as…

This note presents a result on the maximal prime gap of the form p_(n+1) - p_n <= C(log p_n)^(1+e), where C > 0 is a constant, for any arbitrarily small real number e > 0, and all sufficiently large integer n > n_0. Equivalently, the result…

Let $p$ be a fixed prime. We estimate the number of elements of a set $A \subseteq \mathbb{F}^*_p$ for which $$ s_1s_2 \equiv a \pmod{p} \quad \mbox{for some}\quad a \in [-X,X] \quad \mbox{for all}\quad s_1,s_2 \in A. $$ We also consider…

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

In this paper we prove that for any prime $p\ge 11$ holds $$ {2p-1\choose p-1}\equiv 1 -2p \sum_{k=1}^{p-1}\frac{1}{k} +4p^2\sum_{1\le i<j\le p-1}\frac{1}{ij}\pmod{p^7}. $$ This is a generalization of the famous Wolstenholme's theorem which…

Let K be a number field, and let a be a non-zero element of K. Fix some prime number l. We compute the density of the following set: the primes p of K such that the multiplicative order of the reduction of a modulo p is coprime to l (or,…

Let b be an odd integer such that b=+/-1 (mod 8) and let q be a prime with primitive root 2 such that q does not divide b. We show that if (p(k)) is a sequence of odd primes, with 0<=k<=q-2 such that p(k)=2p(k-1)+b for all 1<=k<=q-2, then…

For each integer $t>0$ and each complex simple Lie algebra $\mathfrak{g}$, we determine the least dimension of an irreducible highest weight representation of $\mathfrak{g}$ whose highest weight has height $t$. As a corollary, we classify…

We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…

In this paper, we mainly give a general explicit form of Cassels' $p$-adic embedding theorem for number fields. We also give its refined form in the case of cyclotomic fields. As a byproduct, given an irreducible polynomial $f$ over $Z$, we…

An ideal setting to exhibit infinite sets of primes $p$ relative to which an integer is a primitive root $\pmod p$ is provided by the B\'ezout subdomain $\widetilde{\mathbb{B}}:=\mathbb{Z}^{\mathbb{P}}/\mathfrak{U}$ of the valuation domain…

The concept of p-ordering for a prime p was introduced by Manjul Bhargava (in his PhD thesis) to develop a generalized factorial function over an arbitrary subset of integers. This notion of p-ordering provides a representation of…

Define a permutation $\sigma$ to be coprime if $\gcd(m,\sigma(m)) = 1$ for $m\in[n]$. In this note, proving a recent conjecture of Pomerance, we prove that the number of coprime permutations on $[n]$ is $n!\cdot (c+o(1))^n$ where \[c =…