Pages that link to "Item:Q4654028"

The following pages link to Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟}) (Q4654028):

Displaying 17 items.

• An extension of binary threshold sequences from Fermat quotients (Q340165) (← links)
• Linear complexity of binary sequences derived from Euler quotients with prime-power modulus (Q436622) (← links)
• Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations (Q437681) (← links)
• Wieferich pairs and Barker sequences (Q1039268) (← links)
• Probabilistic study of Fermats quotients (Q1744943) (← links)
• On the divisibility of Fermat quotients (Q1958002) (← links)
• On Wieferich and non-Wieferich primes with prime bases (Q2687585) (← links)
• 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 (Q3055139) (← links)
• Odd perfect numbers have at least nine distinct prime factors (Q3592696) (← links)
• Catalan’s Conjecture: Another old Diophantine problem solved (Q4452145) (← links)
• The Lind-Lehmer constant for certain $p$-groups (Q4561380) (← links)
• The continuing search for Wieferich primes (Q4671853) (← links)
• Odd perfect numbers, Diophantine equations, and upper bounds (Q5264139) (← links)
• The Lind Lehmer constant for ℤ_{𝕡}ⁿ (Q5418510) (← links)
• Browkin’s discriminator conjecture (Q5742271) (← links)
• Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus (Q5859634) (← links)
• Computation of Fermat’s pseudoprimes (Dedicated to the Memory of Professor Leetsch C. Hsu) (Q5865691) (← links)