| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Covering set"
m |
m |
||
| Line 3: | Line 3: | ||
==See also== | ==See also== | ||
*[[Riesel problem]] | *[[Riesel problem]] | ||
| − | *[[ | + | *[[Sierpiński problem]] |
==External links== | ==External links== | ||
| − | *[ | + | *[[Wikipedia:Covering_set|Covering set]] |
[[Category:Math]] | [[Category:Math]] | ||
Revision as of 10:54, 20 February 2019
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.
