Publications and Research

Document Type


Publication Date

Spring 2019


Let $v\geq 2$ be a fixed integer, and let $x \geq 1$ be a large number. The exact asymptotic counting function for the number of nonWieferich primes $p\leq x$ such that $ v^{p-1}-1 \equiv 0 \bmod p^2$ in the interval $[1,x]$ is proposed in this note. The current results in the literature provide lower bounds, which are conditional on the $abc$ conjecture or the Erdos binary additive conjecture.


This is the pre-print version of an article under review.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.