## Publications and Research

#### Title

Results for nonWieferich Primes

Article

Spring 2019

#### Abstract

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.