Remarks on exponential congruences and powerful numbers
This paper considers a number of questions relating the solvability of such congruences as \(a^{p-1}\equiv 1 \pmod{p^2}\) to properties of powerful numbers. In particular, various deductions from, and partial results towards, the conjecture of Erdős, that there do not exist 3 consecutive powerful numbers, are given. In conclusion it is asked, among other things, whether \(m^4-1\) fails to be powerful for ``almost all even \(m\). It seems to the reviewer that much more can be proved, by a simple sieve argument. Namely, if \(f(n)\) is an integer polynomial, not identically powerful as a polynomial, then \(f(n)\) fails to be powerful for ``almost all \(n\).
- Consecutive powers
- scientific article; zbMATH DE number 3957207 (Why is no real title available?)
- scientific article; zbMATH DE number 3713801 (Why is no real title available?)
- scientific article; zbMATH DE number 192864 (Why is no real title available?)
- scientific article; zbMATH DE number 3448653 (Why is no real title available?)
- scientific article; zbMATH DE number 3217986 (Why is no real title available?)
- scientific article; zbMATH DE number 3274021 (Why is no real title available?)
- scientific article; zbMATH DE number 3043854 (Why is no real title available?)
- On powerful numbers
- On the equation $y^m = P(x)$
- On the square-freeness of Fermat and Mersenne numbers
- Powerless in face of the powers
- The first case of Fermat's last theorem
- The First Case of Fermat's Last Theorem is True for all Prime Exponents up to 714,591,416,091,389
- Théorème de Brun-Titchmarsh; application au théorème de Fermat
This page was built for publication: Remarks on exponential congruences and powerful numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106255)