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.
โฆ LIBER โฆ
Integers divisible by sums of powers of their prime factors
โ Scribed by Jean-Marie De Koninck; Florian Luca
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 115 KB
- Volume
- 128
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
โฆ Synopsis
For each positive integer j , let ฮฒ j (n) := p|n p j . Given a fixed positive integer k, we show that there are infinitely many positive integers n having at least two distinct prime factors and such that ฮฒ j (n) | n for each j โ {1, 2, . . . , k}.
๐ SIMILAR VOLUMES
On sums of three integers with a fixed n
โ
Xianmeng Meng
๐
Article
๐
2005
๐
Elsevier Science
๐
English
โ 292 KB
On sums of primes and l-th powers of sma
โ
K Prachar
๐
Article
๐
1970
๐
Elsevier Science
๐
English
โ 233 KB
Representation of Even Integers as Sums
โ
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.
Difference of the digital sums of an int
โ
Wayne L. McDaniel
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 340 KB
The sum of aฮฉ(n) over integers n โค x wit
โ
Douglas Hensley
๐
Article
๐
1984
๐
Elsevier Science
๐
English
โ 289 KB