Large set (combinatorics)
In combinatorial mathematics, a large set of positive integers is one such that the infinite sum of the reciprocals diverges. A small set is any subset of the positive integers that is not large; that is, one whose sum of reciprocals converges. Large sets appear in the Müntz–Szász theorem and in the Erdős conjecture on arithmetic progressions.
Wikipage redirect
Brun's theoremConvergent seriesDivergence of the sum of the reciprocals of the primesErdős conjecture on arithmetic progressionsIdeal (set theory)Index of combinatorics articlesKempner seriesLarge setList of exceptional set conceptsList of number theory topicsList of sums of reciprocalsMüntz–Szász theoremPrime powerSmall setSmall set (combinatorics)Størmer numberSum-free sequenceSuper-prime
Link from a Wikipage to another Wikipage
primaryTopic
Large set (combinatorics)
In combinatorial mathematics, a large set of positive integers is one such that the infinite sum of the reciprocals diverges. A small set is any subset of the positive integers that is not large; that is, one whose sum of reciprocals converges. Large sets appear in the Müntz–Szász theorem and in the Erdős conjecture on arithmetic progressions.
has abstract
In combinatorial mathematics, ...... re on arithmetic progressions.
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,021,557,765
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In combinatorial mathematics, ...... re on arithmetic progressions.
@en
label
Large set (combinatorics)
@en