Covering set

In mathematics, a covering set for a sequence of integers refers to a set of prime numbers such that every term in the sequence is divisible by at least one member of the set.

See also

• Riesel problem
• Sierpiński problem

External links

• Covering set