scientific article; zbMATH DE number 4150268
From MaRDI portal
zbMATH Open0702.11015MaRDI QIDQ3480124FDOQ3480124
Authors: Andrew Granville 
Publication date: 1990
Title of this publication is not available (Why is that?)
Recommendations
Fermat quotientdivisibilitypowerful numbersFermat's Last Theoremfirst casetriples of consecutive powerful numbers
Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Higher degree equations; Fermat's equation (11D41)
Cited In (26)
- Some Computational Results on a Problem Concerning Powerful Numbers
- Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
- Powerless in face of the powers
- Solving \(a x^p + b y^p = c z^p\) with \(abc\) containing an arbitrary number of prime factors
- Fermat's last theorem and Catalan's conjecture in weak exponential arithmetics
- Title not available (Why is that?)
- The ABC conjecture and the powerful part of terms in binary recurring sequences
- From the Taniyama-Shimura conjecture to Fermat's last theorem
- On the 𝑝-divisibility of Fermat quotients
- A search for primes \(p\) such that the Euler number \(E_{p-3}\) is divisible by \(p\)
- Boolean functions derived from Fermat quotients
- On the divisibility of Fermat quotients
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Title not available (Why is that?)
- An extension of binary threshold sequences from Fermat quotients
- The arithmetic of Carmichael quotients
- On the value set of Fermat quotients
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- The distribution of primes satisfying the condition $a^{p-1} ≡ 1 (mod p^{2})$
- Title not available (Why is that?)
- Title not available (Why is that?)
- The power of powerful numbers
- Regular primes, non-Wieferich primes, and finite multiple zeta values of level \(N\)
- On the additive energy of the Heilbronn subgroup
- Title not available (Why is that?)
- On the linear complexity of binary threshold sequences derived from Fermat quotients
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3480124)
