NumberTheoryBasic
Difficult
1987
Find $n$ different positive integers such that any two of them are relatively prime, but the sum of any $k$ ($k < n$) of them is a composite number.
The solution for this problem is available for
$0.99.
You can also purchase a pass for all available solutions for
$99.