Abstract
We state an effective version of the $abc$-conjecture, and assuming it we describe all solutions of some diophantine equations. Based on this conjecture we give an effective algorithm for computing an infinite set of primes which are not Wieferich primes.
Citation
Jerzy Browkin. "A weak effective $abc$-conjecture." Funct. Approx. Comment. Math. 39 (1) 103 - 111, November 2008. https://doi.org/10.7169/facm/1229696557
Information
