✦ LIBER ✦

On sums of three integers with a fixed number of prime factors

✍ Scribed by Xianmeng Meng

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 292 KB
Volume: 114
Category: Article
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2005.04.013

No coin nor oath required. For personal study only.

✦ Synopsis

Let N be sufficiently large odd integer. It is proved that the equation N = n 1 + n 2 + n 3 has solutions, where n i has a fixed number of prime factors, and an asymptotic formula holds for the number of representations.

📜 SIMILAR VOLUMES

On the number of prime factors of intege

On the number of prime factors of integers without large prime divisors

✍ Adolf Hildebrand 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 908 KB

On the number of positive integers ≦ x a

On the number of positive integers ≦ x and free of prime factors > y

✍ Adolf Hildebrand 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 755 KB

On a Sum of Three Prime Squares

✍ Claus Bauer; Ming-Chit Liu; Tao Zhan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 174 KB

Integer Plane Multiflows with a Fixed Nu

Integer Plane Multiflows with a Fixed Number of Demands

✍ A. Sebo 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 371 KB

We give a polynomial algorithm which decides the integer solvability of multicommodity flow problems where the union of "capacity-" and "demand-edges" forms a planar graph, and the number of demand edges is bounded by a prefixed integer \(k\). This problem was solved earlier for \(k=2\) by Seymour a

The sum of aΩ(n) over integers n ≤ x wit

The sum of aΩ(n) over integers n ≤ x with all prime factors between a and y

✍ Douglas Hensley 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 289 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