Sum-free sequence

In mathematics, a sum-free sequence is an increasing sequence of positive integers,

:$a_1, a_2, a_3, \ldots,$

such that no term $a_n$ can be represented as a sum of any subset of the preceding elements of the sequence.

This differs from a sum-free set, where only pairs of sums must be avoided, but where those sums may come from the whole set rather than just the preceding terms.

Example

The powers of two,
:1, 2, 4, 8, 16, ...
form a sum-free sequence: each term in the sequence is one more than the sum of all preceding terms, and so cannot be represented as a sum of preceding terms.

Sums of reciprocals

A set of integers is said to be small if the sum of its reciprocals converges to a finite value. For instance, by the prime number theorem, the prime numbers are not small. proved that every sum-free sequence is small, and asked how large the sum of reciprocals could be. For instance, the sum of the reciprocals of the powers of two (a geometric series) is two.

If $R$ denotes the maximum sum of reciprocals of a sum-free sequence, then through subsequent research it is known that $2.0654 < R < 2.8570$.; ; ; ; ; .

Density

It follows from the fact that sum-free sequences are small that they have zero Schnirelmann density; that is, if $A(x)$ is defined to be the number of sequence elements that are less than or equal to $x$, then $A(x)=o(x)$. showed that for every sum-free sequence there exists an unbounded sequence of numbers $x_i$ for which $A(x_i)=O(x^)$ where $\varphi$ is the golden ratio, and he exhibited a sum-free sequence for which, for all values of $x$, $A(x)=\Omega(x^)$, subsequently improved to $A(x)=\Omega(x^)$ by Deshouillers, Erdős and Melfi in 1999 and to $A(x)=\Omega(x^)$ by Luczak and Schoen in 2000, who also proved that the exponent 1/2 cannot be further improved.

Notes

References

*.
*.
*.
*.
*.
*.
*.
*.

{{DEFAULTSORT:Sum-Free Sequence
Additive combinatorics
Integer sequences