A BINARY ADDITIVE EQUATION INVOLVING FRACTIONAL POWERS

被引：9
|
作者：
Kumchev, Angel V. [1 ]
机构：
[1] Towson Univ, Dept Math, Towson, MD 21252 USA
来源：
INTERNATIONAL JOURNAL OF NUMBER THEORY | 2009年 / 5卷 / 02期
关键词：
Binary additive problem; fractional powers; prime numbers;
D O I：
10.1142/S1793042109002092
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let c be a real number with 1 < c < 2. We study the representations of a large integer n in the form [m(c)] + [p(c)] = n, where m is an integer and p is a prime number. We prove that when 1 < c < 16/15, all sufficiently large integers are thus representable.
引用
收藏
页码：281 / 292
页数：12
相关论文
共 50 条
12345