当前位置: X-MOL 学术J. Number Theory › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On a binary additive problem involving fractional powers
Journal of Number Theory ( IF 0.6 ) Pub Date : 2020-03-01 , DOI: 10.1016/j.jnt.2019.07.019
Gang Yu

Abstract We show that, for any given c ∈ ( 1 , 11 10 ) , every sufficiently large integer n can be represented as n = [ m c ] + [ p c ] , where m is a positive integer and p is a prime, and [ t ] is the integer part of the real number t. We also prove that, when c ∈ ( 1 , 1 + 5 2 ) , such representation exists for almost all positive integers n. These respectively improve the results of A. Kumchev [9] , and Balanzario, Garaev, and Zuazua [1] .

中文翻译:

一个涉及分数幂的二元加法问题

摘要 我们证明,对于任何给定的 c ∈ ( 1 , 11 10 ) ,每个足够大的整数 n 都可以表示为 n = [ mc ] + [ pc ] ,其中 m 是正整数,p 是素数,并且 [ t ] 是实数 t 的整数部分。我们还证明,当 c ∈ ( 1 , 1 + 5 2 ) 时,这种表示对于几乎所有正整数 n 都存在。这些分别改进了 A. Kumchev [9] 和 Balanzario、Garaev 和 Zuazua [1] 的结果。
更新日期:2020-03-01
down
wechat
bug