Sum-free sequence

In mathematics, a sum-free sequence is an increasing sequence of positive integers, a 1 , a 2 , a 3 , … , {\displaystyle a_{1},a_{2},a_{3},\ldots ,} such that no term a n {\displaystyle 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.

Source: Wikipedia — Sum-free sequence (CC BY-SA 4.0)

Sum-free sequence

In mathematics, a sum-free sequence is an increasing sequence of positive integers, a 1 , a 2 , a 3 , … , {\displaystyle a_{1},a_{2},a_{3},\ldots ,} such that no term a n {\displaystyle 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.

This neuron ends here.

Source: Wikipedia "Sum-free sequence" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy