Integer Sequences Avoiding Prime Pairwise Sums

被引：0

作者：

Chen, Yong-Gao ^{[1
]}

机构：

[1] Nanjing Normal Univ, Dept Math, Nanjing 210097, Peoples R China

来源：

JOURNAL OF INTEGER SEQUENCES | 2008年 / 11卷 / 05期

基金：

中国国家自然科学基金;

关键词：

primes; sumsets; distribution of primes;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The following result is proved: If A subset of {1, 2,..., n} is the subset of largest cardinality such that the sum of no two (distinct) elements of A is prime, then | A | =.( n + 1)/2. and all the elements of A have the same parity. The following open question is posed: what is the largest cardinality of A. {1, 2,..., n} such that the sum of no two (distinct) elements of A is prime and A contains elements of both parities?

引用

页数：5