Maximal Sum-Free Set

A maximal sum-free set is a set {a_1,a_2,...,a_n} of distinct natural numbers such that a maximum l of them satisfy a_(i_j)+a_(i_k)!=a_m, for 1<=j<k<=l, 1<=m<=n.

See also

Maximal Zero-Sum-Free Set

Explore with Wolfram|Alpha


Guy, R. K. "Maximal Sum-Free Sets." §C14 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 128-129, 1994.

Referenced on Wolfram|Alpha

Maximal Sum-Free Set

Cite this as:

Weisstein, Eric W. "Maximal Sum-Free Set." From MathWorld--A Wolfram Web Resource.

Subject classifications