The largest prime factor of n<SUP>2</SUP>+1and improvements on subexponential ABC
Loading...
Date
2024
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
We combine transcendental methods and the modular approaches to the ABC conjecture to show that the largest prime factor of n(2)+1isatleastofsize(log(2)n)(2)/log(3)nwhere log k is the k-th iterate of the logarithm. This gives a substantial improvement on the best available estimates, which are essentially of size log2ngoing back to work of Chowla in 1934. Using the same ideas, we also obtain significant progress on sub expoential bounds for the ABC conjecture, which in a case gives the first improvement on a result by Stewart and Yu dating back over two decades. Central toour approach is the connection between Shimura curves and the ABC conjecture developed by the author.
Description
Keywords
11J25, 11J86, 11G18