科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let P denote the set of all primes. Suppose that P(1), P(2), P(3) are three subsets of P with (d) under bar (P)(P(1)) (d) under bar (P)(P(2)) (d) under bar (P)(P(3)) > 2, where (d) under barP(P(i)) is the lower density of P(i) relative to P. We prove that for every sufficiently large odd integer n, there exist p(i) is an element of P(i) such that n = p(1) p(2) p(3).
