2002/07/19 by Constantin M. Petridi, Petridi, Constantin M., Peter B. Krikelis +1
Computer Science · Mathematics · #Analytic Number Theory Research #Computability, Logic, AI Algorithms #FOS: Mathematics #Mathematical Dynamics and Fractals #Number Theory (math.NT) #math.NT
paper · pdf · doi:10.48550/arxiv.math/0207167
4 pages
arxiv created 2002/07/19 · openalex publication_date 2002/07/19 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula connecting the respective number of solutions.