scientific article
From MaRDI portal
Publication:3480124
zbMath0702.11015MaRDI QIDQ3480124
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fermat's Last TheoremdivisibilityFermat quotientpowerful numbersfirst casetriples of consecutive powerful numbers
Higher degree equations; Fermat's equation (11D41) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items (13)
A search for primes 𝑝 such that the Euler number 𝐸_{𝑝-3} is divisible by 𝑝 ⋮ An extension of binary threshold sequences from Fermat quotients ⋮ The arithmetic of Carmichael quotients ⋮ On the additive energy of the Heilbronn subgroup ⋮ On the linear complexity of binary threshold sequences derived 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 ⋮ On the 𝑝-divisibility of Fermat quotients ⋮ On the divisibility of Fermat quotients ⋮ On the value set of Fermat quotients ⋮ Boolean functions derived from Fermat quotients ⋮ The ABC conjecture and the powerful part of terms in binary recurring sequences ⋮ Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus
This page was built for publication:
