Theoretical analysis demonstrates the infinitude of primitive abundant numbers in arithmetic progressions with deficient common divisors, highlighting structure in divisor theory.
Using Dirichlet's theorem on arithmetic progressions, we show that if a and b are positive integers with a deficient greatest common divisor, the arithmetic progression ak + b contains infinitely many primitive abundant numbers.
No takes yet. Share an insight, caveat, or question.
Mert Ünsal (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: