New Solutions of a p - 1 ≡1 (mod p 2 )

DOI10.2307/2152960zbMath0788.11002WikidataQ105838081 ScholiaQ105838081MaRDI QIDQ3137474

Peter L. Montgomery

Publication date: 9 November 1993

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2152960

zbMATH Keywords

computational techniques; Fibonacci number; Fermat quotients; table of solutions

Mathematics Subject Classification ID

11D61: Exponential Diophantine equations

11-04: Software, source code, etc. for problems pertaining to number theory

Related Items

On the 𝑝-divisibility of Fermat quotients, On divisibility of the class number ℎ⁺ of the real cyclotomic fields of prime degree 𝑙, Every odd perfect number has a prime factor which exceeds 10⁶, Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟}), The continuing search for Wieferich primes, The third largest prime divisor of an odd perfect number exceeds one hundred, A search for Wieferich and Wilson primes, The arithmetic of Carmichael quotients, On the generalized Pillai equation \(\pm a^{x}\pm b^{y}=c\), Wieferich pairs and Barker sequences, Fermat quotients for composite moduli, Quadratic fields, \(GL_ 2(\mathbb{Z})\) and Dickson polynomials, A new prime $p$ for which the least primitive root $({\rm mod} p)$ and the least primitive root $({\rm mod} p^2)$ are not equal, Unnamed Item, A search for Fibonacci-Wieferich and Wolstenholme primes, Odd perfect numbers have at least nine distinct prime factors