Sums of Numbers with Many Divisors

Paul Erdos, Hugh L. Montgomery

Research output: Article

1 Citation (Scopus)


Letkbe a fixed integer,k≥2, and suppose thatε>0. We show that every sufficiently large integerncan be expressed in the formn=m1+m2+...+mkwhered(m i)>n(log2-ε)(1-1/k)/loglognfor alli. This is best possible, since there are infinitely many exceptionalnif the factor log2-εis replaced by log2+ε.

Original languageEnglish
Pages (from-to)1-6
Number of pages6
JournalJournal of Number Theory
Issue number1
Publication statusPublished - márc. 1 1999

ASJC Scopus subject areas

  • Algebra and Number Theory

Fingerprint Dive into the research topics of 'Sums of Numbers with Many Divisors'. Together they form a unique fingerprint.

  • Cite this