A DIOPHANTINE EQUATION INVOLVING SPECIAL PRIME NUMBERS

被引：2
|
作者：
Dimitrov, Stoyan [1 ]
机构：
[1] Tech Univ Sofia, 8 Kl Ohridski Blvd, Sofia 1000, Bulgaria
来源：
CZECHOSLOVAK MATHEMATICAL JOURNAL | 2023年 / 73卷 / 01期
关键词：
Diophantine equation; prime; exponential sum; asymptotic formula; EXPONENTIAL-SUMS; INEQUALITY;
D O I：
10.21136/CMJ.2022.0469-21
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let [.] be the floor function. In this paper, we prove by asymptotic formula that when 1 < c < 3441/2539, then every sufficiently large positive integer N can be represented in the form N = [p(1)(c)] + [p(2)(c)] + [p(3)(c)] + [p(4)(c)] + [p(5)(c)], where p(1), p(2), p(3), p(4), p(5) are primes such that p(1) = x(2) + y(2) + 1.
引用
收藏
页码：151 / 176
页数：26
相关论文
共 50 条
12345