请输入您要查询的百科知识：

　

词条 Complete sequence
释义

  1. Conditions for completeness

  2. Other complete sequences

  3. Applications

     Fibonacci coding  Other coding systems 

  4. See also

  5. References

  6. External links

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 = 1001012 = 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.
  • Powers of three—no integer having a digit "2" in its ternary representation (2, 5, 6...) can be formed.

Conditions for completeness

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

.

Then the conditions

are both necessary and sufficient for an to be a complete sequence.[1][2]

A corollary to the above states that

are sufficient for an to be a complete sequence.[1]

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

Other complete sequences

Below is a list of the better-known complete sequences.

  • The sequence of the number 1 followed by the prime numbers (studied by S. S. Pillai[3] and others); this follows from Bertrand's postulate.[1]
  • The sequence of practical numbers which has 1 as the first term and contains all other powers of 2 as a subset.[4] {{OEIS|id=A005153}}
  • The Fibonacci numbers, as well as the Fibonacci numbers with any one number removed.[1] This follows from the identity that the sum of the first n Fibonacci numbers is the (n + 2)nd Fibonacci number minus 1 (see Fibonacci_numbers#Second_identity).
  • All Fibonacci n-Step numbers,[5] where n=2 gives the Fibonacci numbers above, n=3 gives the Tribonacci numbers etc.
  • The Lazy caterer's sequence that gives the maximum number of partitions that a plane can be divided into, using n straight lines as dividers.
  • All higher dimensions of the Lazy caterer's sequence that uses n hyperplanes (of dimension d-1) to maximally divide a space (of dimension d). {{OEIS|id=A216274}}
  • The Cookie cutter's sequence that gives the maximum number of partitions that a plane can be divided into, using n circles as dividers.[6]
  • All higher dimensions of the Cookie cutter's sequence that uses n hyperspherical surfaces (of dimension d-1) to maximally divide a space (of dimension d). {{OEIS|id=A059250}}
  • The ordered set of proper divisors of every practical number (that includes 1 and itself) forms a complete sub-sequence.

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:

 110111 (F6 + F5 + F3 + F2 + F1 = 8 + 5 + 2 + 1 + 1 = 17, maximal form)

 111001 (F6 + F5 + F4 + F1 = 8 + 5 + 3 + 1 = 17)

 111010 (F6 + F5 + F4 + F2 = 8 + 5 + 3 + 1 = 17)

1000111 (F7 + F3 + F2 + F1 = 13 + 2 + 1 + 1 = 17)

1001001 (F7 + F4 + F1 = 13 + 3 + 1 = 17)

1001010 (F7 + F4 + F2 = 13 + 3 + 1 = 17, minimal form, as used in Fibonacci coding)

The maximal form above will always use F1 and will always have a trailing one. The full coding without the trailing one can be found at

{{OEIS|id=A104326}}. Note that by dropping the trailing one, the coding for 17 above occurs as the 16th term of A104326.

The minimal form will never use F1 and will always have a trailing zero. The full coding without the trailing zero can be found at

{{OEIS|id=A014417}}. 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.[7] 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.

Other coding systems

Other coding systems can be similarly devised. As with the Fibonacci sequence above, these coding systems that employ complete sequences will need to deal with multiple encoding solutions. The two main methods used are the greedy algorithm that will attempt to minimize the number of terms needed to encode an integer from the complete sequence and a minimizing algorithm that will attempt to maximize the number of terms needed to encode the same integer.

  • A coding for the sequence of the number 1 followed by the prime numbers using the greedy algorithm can be found at

{{OEIS|id=A007924}}.

  • A coding for the sequence of the number 1 followed by the prime numbers using a minimizing algorithm can be found at

{{OEIS|id=A205598}}.

  • A coding for the Lazy caterer's sequence using the greedy algorithm can be found at

{{OEIS|id=A204009}}.

See also

  • Ostrowski numeration

References

1. ^1 2 3 Honsberger, R. Mathematical Gems III. Washington, DC: Math. Assoc. Amer., 1985, pp.123-128.
2. ^{{Cite journal|last=Brown|first=J. L.|date=1961|title=Note on Complete Sequences of Integers|journal=The American Mathematical Monthly|volume=68|issue=6|pages=557–560|doi=10.2307/2311150|jstor=2311150}}
3. ^S. S. Pillai, "An arithmetical function concerning primes", Annamalai University Journal (1930), pp. 159–167.
4. ^{{Citation|last = Srinivasan |first = A. K.|title = Practical numbers|journal = Current Science|volume = 17|year = 1948|pages = 179–180|mr = 0027799|url = http://www.currentscience.ac.in/Downloads/article_id_017_06_0179_0180_0.pdf}}.
5. ^{{Mathworld|title=Fibonacci n-Step Number|urlname=Fibonaccin-StepNumber}}
6. ^{{Mathworld|title=Plane Division by Circles|urlname=PlaneDivisionbyCircles}}
7. ^Stakhov, Alexey. {{cite web |url=http://www.goldenmuseum.com/1202FibCdeTransf_engl.html |archive-url=https://archive.is/20130124230213/http://www.goldenmuseum.com/1202FibCdeTransf_engl.html |archive-date=January 24, 2013 |title=The main operations of the Fibonacci arithmetic |dead-url=yes |access-date=September 11, 2016}}, Museum of Harmony and Golden Section. Originally accessed: 27 July 2010.

External links

  • {{MathWorld | urlname=CompleteSequence | title=Complete Sequence}}
{{Series (mathematics)}}

1 : Integer sequences
随便看

　

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。

　

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间：2024/9/21 18:50:41