✦ LIBER ✦

The Largest Integer Expressible as a Sum of Reciprocal of Integers

✍ Scribed by Hisashi Yokota

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 113 KB
Volume: 76
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.1998.2359

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

ERRATUM: Volume 76, Number 2 (1999), in

ERRATUM: Volume 76, Number 2 (1999), in the article “The Largest Integer Expressible as a Sum of Reciprocal of Integers,” by Hisashi Yokota, pages 206–216

📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 40 KB

Representations of Integers as Sums of S

Representations of Integers as Sums of Squares

✍ Ken Ono 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 92 KB

On Number of Integers Representable as a

On Number of Integers Representable as a Sum of Unit Fractions, II

✍ Hisashi Yokota 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 262 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)

On the Construction of Sets of Integers

On the Construction of Sets of Integers with Equal Power Sums

✍ M. Jacroux 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 216 KB

In this paper we give a new method for constructing sets of integers having equal th power sums. Using the method, some new results are derived concerning the Tarry-Escott Problem. i' 1995 Academic Press. Inc.

Representation of Even Integers as Sums

Representation of Even Integers as Sums of Squares of Primes and Powers of 2

✍ Jianya Liu; Ming-Chit Liu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 185 KB

As an extension of the Linnik Gallagher results on the ``almost Goldbach'' problem, we prove that every large even integer is a sum of four squares of primes and 8330 powers of 2.