Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})

DOI10.1090/S0025-5718-04-01666-7MaRDI QIDQ4654028zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Wilfrid Keller, Jörg Richstein

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

zbMATH Keywords

Diophantine equationFermat quotientlarge primesprimitive roots

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Congruences; primitive roots; residue systems (11A07) Exponential Diophantine equations (11D61)

Recommendations

• New Solutions of a p - 1 ≡1 (mod p 2 )
• An investigation of solutions to x^n a m in elementary number theory
• scientific article; zbMATH DE number 3344628
• Computing solutions to the congruence \(1^n + 2^n + \ldots + n^n \equiv p \pmod n\)
• On Fermat's Quotient, Base Two

Cites work

• A search for Wieferich and Wilson primes
• Catalan's Equation x p - y q = 1 and Related Congruences
• scientific article; zbMATH DE number 1467844 (Why is no real title available?)
• scientific article; zbMATH DE number 861252 (Why is no real title available?)
• scientific article; zbMATH DE number 3344628 (Why is no real title available?)
• New Solutions of a p - 1 ≡1 (mod p 2 )
• Note on the Congruence a p-1 ≡1 (mod p 2 )
• On Catalan's conjecture
• On the 𝑝-divisibility of Fermat quotients
• The continuing search for Wieferich primes

Cited in

(20)

• 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 \(\pmod p\) and the least primitive root \(\pmod {p^2}\) are not equal
• New Solutions of a p - 1 ≡1 (mod p 2 )
• An extension of binary threshold sequences from Fermat quotients
• Odd perfect numbers have at least nine distinct prime factors
• scientific article; zbMATH DE number 4002170 (Why is no real title available?)
• 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
• 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 \(\mathbb Z_p^n\)
• scientific article; zbMATH DE number 3344628 (Why is no real title available?)
• 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)

This page was built for publication: Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4654028)