2023/02/06 by Prajeet Bajpai, Michael A. Bennett, Bajpai, Prajeet +3
Computer Science · Mathematics · #Analytic Number Theory Research #Computability, Logic, AI Algorithms #FOS: Mathematics #History and Theory of Mathematics #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2302.03113
openalex publication_date 2023/02/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We answer a number of questions of Erdős on the existence of arithmetic progressions in k-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the k-th power). Further, we deduce a variety of arithmetic constraints upon such progressions, under the assumption of the abc-conjecture of Masser and Oesterlé.