Publication:3480124
From MaRDI portal
zbMath0702.11015MaRDI QIDQ3480124
Publication date: 1990
Fermat's Last Theorem; divisibility; Fermat quotient; powerful numbers; first case; triples of consecutive powerful numbers
11D41: Higher degree equations; Fermat's equation
11A05: Multiplicative structure; Euclidean algorithm; greatest common divisors
Related Items
On the ๐-divisibility of Fermat quotients, On the value set of Fermat quotients, Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus, An extension of binary threshold sequences from Fermat quotients, The arithmetic of Carmichael 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, Boolean functions derived from Fermat quotients, The ABC conjecture and the powerful part of terms in binary recurring sequences, On the linear complexity of binary threshold sequences derived from Fermat quotients, On the divisibility of Fermat quotients, On the additive energy of the Heilbronn subgroup, A search for primes ๐ such that the Euler number ๐ธ_{๐-3} is divisible by ๐