| 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"
(new) |
(link) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | In [[mathematics]], a '''covering set''' for a sequence of integers refers to a set of [[prime | + | 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== | ==See also== | ||
| − | *[[Riesel problem]] | + | *[[Riesel problem 1|Riesel problem]] |
| − | *[[ | + | *[[Riesel_2_Riesel|Riesel numbers]] |
| + | *[[Sierpiński problem]] | ||
==External links== | ==External links== | ||
| − | *[ | + | *[[Wikipedia:Covering_set|Covering set]] |
[[Category:Math]] | [[Category:Math]] | ||
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.
