The number of abc-equations c^n=a+b stisfying the strong abc-conjecture

Abstract

We prove that the frequency of abc equations c^n = a+b satisfying the strong abc - conjecture is phi(c^n)/2+o(phi(c^n)/2), for n going to infinity.

arXiv comment3 pages

References in corpus (2)

• A strong "abc-conjecture" for certain partitions a+b of c
• The number of equations c=a+b satisfying the abc-conjecture