Complete sequence

In mathematics, a sequence of natural numbers is called a complete sequence if every positive integer can be expressed as a sum of values in the sequence, using each value at most once.

For example, the sequence of powers of two (1, 2, 4, 8, ...), the basis of the binary numeral system, is a complete sequence; given any natural number, we can choose the values corresponding to the 1 bits in its binary representation and sum them to obtain that number (e.g. 37 = 100101₂ = 1 + 4 + 32). This sequence is minimal, since no value can be removed from it without making some natural numbers impossible to represent. Simple examples of sequences that are not complete include the even numbers, since adding even numbers produces only even numbers—no odd number can be formed.

Conditions for completeness

Without loss of generality, assume the sequence a_n is in non-decreasing order, and define the partial sums of a_n as:

$s_n=\sum _{m=0}^n{a}_m$.

Then the conditions

$a_0=1$

$s_{k-1}\ge a_k-1\text{ for all }k\ge 1$

are both necessary and sufficient for a_n to be a complete sequence.

A corollary to the above states that

$a_0=1$

$2a_k\ge a_{k+1}\text{ for all }k\ge 0$

are sufficient for a_n to be a complete sequence.

However there are complete sequences that do not satisfy this corollary, Template:Anchor for example Template:OEIS, consisting of the number 1 and the first prime after each power of 2.

Other complete sequences

The complete sequences include:

• The sequence of the number 1 followed by the prime numbers (studied by S. S. Pillai and others); this follows from Bertrand's postulate.
• The sequence of practical numbers which has 1 as the first term and contains all other powers of 2 as a subset. Template:OEIS
• The Fibonacci numbers, as well as the Fibonacci numbers with any one number removed. This follows from the identity that the sum of the first n Fibonacci numbers is the (n + 2)nd Fibonacci number minus 1.

Applications

Just as the powers of two form a complete sequence due to the binary numeral system, in fact any complete sequence can be used to encode integers as bit strings. The rightmost bit position is assigned to the first, smallest member of the sequence; the next rightmost to the next member; and so on. Bits set to 1 are included in the sum. These representations may not be unique.

Fibonacci coding

For example, in the Fibonacci arithmetic system, based on the Fibonacci sequence, the number 17 can be encoded in six different ways:

Template:Figure space110111 (F₆ + F₅ + F₃ + F₂ + F₁ = 8 + 5 + 2 + 1 + 1 = 17, maximal form)

Template:Figure space111001 (F₆ + F₅ + F₄ + F₁ = 8 + 5 + 3 + 1 = 17)

Template:Figure space111010 (F₆ + F₅ + F₄ + F₂ = 8 + 5 + 3 + 1 = 17)

1000111 (F₇ + F₃ + F₂ + F₁ = 13 + 2 + 1 + 1 = 17)

1001001 (F₇ + F₄ + F₁ = 13 + 3 + 1 = 17)

1001010 (F₇ + F₄ + F₂ = 13 + 3 + 1 = 17, minimal form, as used in Fibonacci coding)

The maximal form above will always use F₁ and will always have a trailing one. The full coding without the trailing one can be found at Template:OEIS. By dropping the trailing one, the coding for 17 above occurs as the 16th term of A104326. The minimal form will never use F₁ and will always have a trailing zero. The full coding without the trailing zero can be found at Template:OEIS. This coding is known as the Zeckendorf representation.

In this numeral system, any substring "100" can be replaced by "011" and vice versa due to the definition of the Fibonacci numbers. Continual application of these rules will translate form the maximal to the minimal, and vice versa. The fact that any number (greater than 1) can be represented with a terminal 0 means that it is always possible to add 1, and given that, for 1 and 2 can be represented in Fibonacci coding, completeness follows by induction.

See also

• Ostrowski numeration

External links

• Template:MathWorld