✦ LIBER ✦

Sums of Divisors and Egyptian Fractions

✍ Scribed by C.N. Friedman

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 470 KB
Volume: 44
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.1993.1057

No coin nor oath required. For personal study only.

✦ Synopsis

We discuss the problem of representing a natural number (n) as a sum of certain of its distinct positive proper ((\neq n)) divisors. If this is possible (n) is called semiperfect. We present a method which leads in certain cases to a verification that all abundant numbers with prime divisors limited to a fixed set of primes are semiperfect. We then discuss the Egyptian fraction representation of positive rational numbers (i.e., the representation as a sum of reciprocals of distinct integers (>1) ). In particular we obtain results relating the primes occurring in such representations to the primes occurring in the denominator of the rational being represented. This leads to further results concerning the existence of semiperfect numbers with certain prime factors. 1993 Academic Press, Inc.

📜 SIMILAR VOLUMES

Sums of Numbers with Many Divisors

✍ Paul Erdős; Hugh L Montgomery 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 87 KB

Let k be a fixed integer, k 2, and suppose that =>0. We show that every sufficiently large integer n can be expressed in the form n=m 1 +m 2 + } } } +m k where d(m i )>n (log 2&=)(1&1Âk)Âlog log n for all i. This is best possible, since there are infinitely many exceptional n if the factor log 2&= i

Note on sums containing small divisors

✍ Helmut Rüßmann 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

On the sum of Divisors Function

✍ U. Balakrishnan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 484 KB

On Sums of Fractional Parts {nα+γ}

✍ Christopher Pinner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Fractional Calculus and the Sums of Cert

Fractional Calculus and the Sums of Certain Families of Infinite Series

✍ J.A. Deduran; S.L. Kalla; H.M. Srivastava 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 484 KB

On the Number of Integers Representable

On the Number of Integers Representable as Sums of Unit Fractions, III

✍ Hisashi Yokota 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 176 KB

Let NðnÞ be the set of all integers that can be expressed as a sum of reciprocals of distinct integers 4n: Then we prove that for sufficiently large n; which improves the lower bound given by Croot. # 2002 Elsevier Science (USA)