Related papers: Lehmer numbers and primitive roots modulo a prime

In 1958 E. Lehmer found an explicit description of those primes p for which a given prime q is a cubic residue. In this paper we demonstrate that a similar result may be obtained for cubic nonresidues, yielding a cubic character for fixed p…

This paper establishes an extension of Wolstenholme's theorem to the ring of Gaussian integers $\mathbb{Z}[i]$. For a prime $p > 7$, we prove that the sum $S_p$ of inverses of Gaussian integers in the set $\{n+mi \mid 1 \leq n, m \leq p-1,…

In the present paper we obtain new upper bound estimates for the number of solutions of the congruence $$ x\equiv y r\pmod p;\quad x,y\in \mathbb{N},\quad x,y\le H,\quad r\in\cU, $$ for certain ranges of $H$ and $|\cU|$, where $\cU$ is a…

There is a probability charge on the power set of the integers that gives probability $1/p$ to every residue class modulo a prime $p$. There exists such a charge that gives probability $w$ to the set of prime numbers iff $w \in [0,1/2]$.…

We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…

Suppose $ m,n\geq 2 $ are co prime integers. We prove certain new symmetries of the base $ n $ representation of $ 1/m $, and in particular characterize the subgroup generated by $ n $ inside $ (\mathbb{Z}/m\mathbb{Z})^\times $. As an…

We study congruences modulo powers of a prime $p$ between pairs of $p$-new modular Hecke eigenforms of level $\Gamma_0(p)$ and same weight $k$. Based on explicit computations, we conjecture that every such eigenform $f$ admits a twin to…

We show that if p is an odd prime then $$\sum_{k=0}^{p-1}E_kE_{p-1-k}=1 (mod p)$$ and $$\sum_{k=0}^{p-3}E_kE_{p-3-k}=(-1)^{(p-1)/2}2E_{p-3} (mod p),$$ where E_0,E_1,E_2,... are Euler numbers. Moreover, we prove that for any positive integer…

Let $p$ be a large prime number. We prove that any integer $\lambda$ modulo $p$ can be represented in the form $$ m!n! +\sum_{i=1}^{47}n_i!\equiv \lambda \pmod p, $$ with $\max\{m,n,n_1,\ldots,n_{47}\}\ll p^{1300/1301}.$ This improves the…

Let $p>3$ be a prime, and let $a$ be a rational $p$-adic integer, using WZ method we establish the congruences modulo $p^3$ for $$\sum_{k=0}^{p-1} \binom ak\binom{-1-a}k\binom{2k}k\frac {w(k)}{4^k},$$ where $$w(k)=1,\frac 1{k+1},\frac…

Let p be a prime, and let n>0 and r be integers. In 1913 Fleck showed that $$F_p(n,r)=(-p)^{-[(n-1)/(p-1)]}\sum_{k=r(mod p)}\binom{n}{k}(-1)^k\in\Z.$$ Nowadays this result plays important roles in many aspects. Recently Sun and Wan…

For any natural number $\ell $ and any prime $p\equiv 1 \pmod{4}$ not dividing $\ell $ there is a Hermitian modular form of arbitrary genus $n$ over $L:=\Q [\sqrt{-\ell}]$ that is congruent to 1 modulo $p$ which is a Hermitian theta series…

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

In this paper, we prove that for any $A>0$ there exist infinitely many primes $p$ for which sums of the Legendre symbol modulo $p$ over an interval of length $(\ln p)^A$ can take large values.

Let $n, k$ and $a$ be positive integers. The Stirling numbers of the first kind, denoted by $s(n,k)$, count the number of permutations of $n$ elements with $k$ disjoint cycles. Let $p$ be a prime. In recent years, Lengyel, Komatsu and…

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

Issai Schur once asked if it was possible to determine a bound, preferably using elementary methods, such that for all prime numbers p greater than the bound, the greatest number of consecutive quadratic non-residues modulo p is always less…

In this note, we review some facts about polynomials representing functions modulo primes p. In addition we prove that the polynomial f(x) = x^{p-2} + x^{p-3} + ... + x^3 + x^2 + 2x + 1 represents the transposition (0 1) modulo p, that is,…

We showed that the prime gap for a prime number p is less than or equal to the prime count of the prime number.

Let $n$ be an arbitrary integer, let $p$ be a prime factor of $n$. Denote by $\omega_1$ the $p^{th}$ primitive unity root, $\omega_1:=e^{\frac{2\pi i}{p}}$. Define $\omega_i:=\omega_1^i$ for $0\leq i\leq p-1$ and…