| 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 |
(link) |
||
| Line 2: | Line 2: | ||
==See also== | ==See also== | ||
| − | *[[Riesel problem]] | + | *[[Riesel problem 1|Riesel problem]] |
| + | *[[Riesel_2_Riesel|Riesel numbers]] | ||
*[[Sierpiński problem]] | *[[Sierpiński problem]] | ||
Latest revision as of 10:27, 26 March 2024
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.
