Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})
From MaRDI portal
Publication:4654028
DOI10.1090/S0025-5718-04-01666-7zbMath1137.11301WikidataQ56226396 ScholiaQ56226396MaRDI QIDQ4654028
Jörg Richstein, Wilfrid Keller
Publication date: 1 March 2005
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-04-01666-7
11A07: Congruences; primitive roots; residue systems
11D61: Exponential Diophantine equations
11-04: Software, source code, etc. for problems pertaining to number theory
Related Items
Catalan’s Conjecture: Another old Diophantine problem solved, The Lind-Lehmer constant for certain $p$-groups, The continuing search for Wieferich primes, Odd perfect numbers, Diophantine equations, and upper bounds, The Lind Lehmer constant for ℤ_{𝕡}ⁿ, Browkin’s discriminator conjecture, Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus, Computation of Fermat’s pseudoprimes (Dedicated to the Memory of Professor Leetsch C. Hsu), An extension of binary threshold sequences from Fermat quotients, Linear complexity of binary sequences derived from Euler quotients with prime-power modulus, Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations, Wieferich pairs and Barker sequences, Probabilistic study of Fermats quotients, On the divisibility of Fermat quotients, On Wieferich and non-Wieferich primes with prime bases, 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, Odd perfect numbers have at least nine distinct prime factors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Catalan's conjecture
- New Solutions of a p - 1 ≡1 (mod p 2 )
- Catalan's Equation x p - y q = 1 and Related Congruences
- On the 𝑝-divisibility of Fermat quotients
- The continuing search for Wieferich primes
- A search for Wieferich and Wilson primes
- Note on the Congruence a p-1 ≡1 (mod p 2 )