Multiplicative decomposability of shifted sets

The following two problems are open.

1. Do two sets of positiveintegers and exist, with at leasttwo elements each, suchthat + coincides with the set of primes for sufficiently largeelements?
2. Let ={6, 12, 18}. Is there an infinite set of positiveintegerssuch that +1? A positive answer would imply that thereare infinitelymany Carmichael numbers with three prime factors.

In this paper we prove the multiplicative analogue of the firstproblem, namely that there are no two sets and , with at leasttwo elements each, such that the product coincides with anyadditively shifted copy +c of the set of primes for sufficientlylarge elements. We also prove that shifted copies of sets ofintegers that are generated by certain subsets of the primescannot be multiplicatively decomposed.