检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]School of Mathematical Sciences and Institute of Mathematics, Nanjing Normal University [2]Department of Mathematics, Nanjing University of Information Science & Technology
出 处:《Science China Mathematics》2014年第12期2519-2524,共6页中国科学:数学(英文版)
基 金:supported by National Natural Science Foundation of China(Grant Nos.11371195 and 11201237)
摘 要:For any integer s ≥ 2, let μs be the least integer so that every integer l 〉 μs is the sum of exactly s integers which are pairwise relatively prime. In 1964, Sierpifiski asked for the determination of μs. Let Pi be the i-th prime and let μs = p2 +P3 + … +ps+1+ cs. Recently, the authors solved this problem. In particular, we have (1) cs = -2 if and only if s = 2; (2) the set of integers s with cs= 1100 has asymptotic density one; (3) cs ∈ A for all s ≥ 3, where A is an explicit set with A [2, 1100] and |A| = 125. In this paper, we prove that, (1) for every a ∈ A, there exists an index s with cs = there are infinitely many s with es = a. We also point out can be applied to this problem. a; (2) under Dickson's conjecture, for every a∈ A, that recent progress on small gaps between primesFor any integer s≥ 2, let μsbe the least integer so that every integer l > μs is the sum of exactly s integers which are pairwise relatively prime. In 1964, Sierpi′nski asked for the determination of μs. Let pibe the i-th prime and let μs= p2 + p3 + + ps+1+ cs. Recently, the authors solved this problem. In particular,we have(1) cs=-2 if and only if s = 2;(2) the set of integers s with cs= 1100 has asymptotic density one;(3) cs∈ A for all s ≥ 3, where A is an explicit set with A ■[2, 1100] and |A| = 125. In this paper, we prove that,(1) for every a ∈ A, there exists an index s with cs= a;(2) under Dickson's conjecture, for every a ∈ A,there are infinitely many s with cs= a. We also point out that recent progress on small gaps between primes can be applied to this problem.
关 键 词:Sierpinski's problem consecutive primes Dickson's conjecture pairwise relatively prime
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117