标题:A binary additive problem with fractional powers
作者:Zhu, Wenbin
作者机构:[Zhu, Wenbin] Shandong Univ, Sch Math, 27 Shanda Nanlu, Jinan 250100, Shandong, Peoples R China.
通讯作者:Zhu, WB
通讯作者地址:[Zhu, WB]Shandong Univ, Sch Math, 27 Shanda Nanlu, Jinan 250100, Shandong, Peoples R China.
来源:INTERNATIONAL JOURNAL OF NUMBER THEORY
出版年:2018
卷:14
期:1
页码:221-232
DOI:10.1142/S1793042118500136
关键词:Binary additive problem; fractional powers; friable numbers
摘要:Let c be a real number with 1 < c < 2. We study the representations of a large integer N in the form; N = [n(c)] + [m(c)],; where n is an integer and m is a friable number with P(m) <= y for y >= (logN)(theta). We prove that when theta > 4.5 and 1 < c < (12 + 9(1 - 1/theta))/19, all sufficiently large integers are thus representable.
收录类别:SCOPUS;SCIE
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85023774595&doi=10.1142%2fS1793042118500136&partnerID=40&md5=3dc5cbbc1bbcbf92ee23cfaa30980f61
TOP