On a Diophantine equation involving fractional powers with primes of special types

被引：0
|
作者：
Wu, Liuying [1 ]
机构：
[1] Tongji Univ, Sch Math Sci, Shanghai 200092, Peoples R China
来源：
AIMS MATHEMATICS | 2024年 / 9卷 / 06期
关键词：
almost prime; diophantine equality; fractional powers; exponential sum; ADDITIVE PROBLEMS; THEOREM; NUMBER;
D O I：
10.3934/math.2024799
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Suppose that N is a sufficiently large real number. In this paper it is proved that for 2 < c< 990/479, the Diophantine equation [p(1)(c)] + [p(2)(c)] + [p(3)(c)] + [p(4)(c)] + [p(5)(c)] = N is solvable in primes p(1), p(2), p(3), p(4), p(5) such that each of the numbers p(i )+ 2, i = 1, 2, 3, 4, 5 has at most [6227/3960-1916c] prime factors.
引用
收藏
页码：16486 / 16505
页数：20
相关论文
共 34 条
1234