Year: 2021
Type: preprint
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|(a^n \pm b^n)$, we prove the identity $$ν_p(a^n \pm b^n)-ν_p(n)=ν_p(a^{p-1}-b^{p-1}).$$ An unintended interesting immediate consequence is the following variant of Wieferich's criterion for FLT : Let $x^n+y^n=z^n$ with $n$ prime and $x,y,z$ pairwise relatively prime. Then every odd prime $p|y$ satisfies $ν_p(z^{p-1}-x^{p-1}) \ge n-1$ and every odd prime $p|x$ satisfies $ν_p(z^{p-1}-y^{p-1}) \ge n-1$, and every odd prime $p|z$ satisfies $ν_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$.
Source: arXiv (Cornell University)
Author: Chua, Kok Seng
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4226200317