A p-adic identity for Wieferich primes
Abstract
Let n be a positive integer, p be an odd prime and integers a,b = 0 with gcd(a,b)=1, p ab, and p|(an bn), we prove the identity p(an bn)-p(n)=p(ap-1-bp-1). An unintended interesting immediate consequence is the following variant of Wieferich's criterion for FLT : Let xn+yn=zn with n prime and x,y,z pairwise relatively prime. Then every odd prime p|y satisfies p(zp-1-xp-1) n-1 and every odd prime p|x satisfies p(zp-1-yp-1) n-1, and every odd prime p|z satisfies p(xp-1-yp-1) n-1, ie. every odd prime dividing xyz is a Wieferich prime of order at least n-1 to some base pair. In the "first case" where n xyz, the lower bound for the Wieferich order can be improved to n. This gives us very strong intuition why there should not be any solution even for moderately large n.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.