Papers
Topics
Authors
Recent
Search
2000 character limit reached

A p-adic identity for Wieferich primes

Published 8 Dec 2021 in math.NT | (2112.04173v1)

Abstract: Let $n$ be a positive integer, $p$ be an odd prime and integers $a,b \not= 0$ with $gcd(a,b)=1$, $p \nmid ab$, and $p|(an \pm bn)$, we prove the identity $$\nu_p(an \pm bn)-\nu_p(n)=\nu_p(a{p-1}-b{p-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 $\nu_p(z{p-1}-x{p-1}) \ge n-1$ and every odd prime $p|x$ satisfies $\nu_p(z{p-1}-y{p-1}) \ge n-1$, and every odd prime $p|z$ satisfies $\nu_p(x{p-1}-y{p-1}) \ge 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 \nmid 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$.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.