Small set (combinatorics)

From formulasearchengine
Jump to navigation Jump to search

{{#invoke:Hatnote|hatnote}} In combinatorial mathematics, a small set of positive integers

is one such that the infinite sum

converges. A large set is one whose sum of reciprocals diverges.


  • The set of numbers whose decimal representations exclude 7 (or any digit one prefers) is small. That is, for example, the set
is small. (This has been generalized to other bases as well.) See Kempner series.


  • A union of finitely many small sets is small, as the sum of two convergent series is a convergent series. A union of infinitely many small sets is either a small set (e.g. the sets of p2, p3, p4, ... where p is prime) or a large set (e.g. the sets for k > 0). Also, a large set minus a small set is still large. A large set minus a large set is either a small set (e.g. the set of all prime powers pn with n ≥ 1 minus the set of all primes) or a large set (e.g. the set of all positive integers minus the set of all positive even numbers). In set theoretic terminology, the small sets form an ideal.
is dense in the uniform norm topology of continuous functions on a closed interval. This is a generalization of the Stone–Weierstrass theorem.

Open problems

It is not known how to identify whether a given set is large or small in general. As a result, there are many sets which are not known to be either large or small.

Paul Erdős famously asked the question of whether any set that does not contain arbitrarily long arithmetic progressions must necessarily be small. He offered a prize of $3000 for the solution to this problem, more than for any of his other conjectures, and joked that this prize offer violated the minimum wage law.[1] This question is still open.


  1. Carl Pomerance, Paul Erdős, Number Theorist Extraordinaire. (Part of the article The Mathematics of Paul Erdős), in Notices of the AMS, January, 1998.