On weakly complete sequences formed by the greedy algorithm
An increasing sequence of positive integers \(a_1,a_2,\dots\) is complete if every positive integer can be written as a sum of distinct elements of the sequence. (An obvious example is the Fibonacci sequence.) Similarly, a sequence is said to be weakly complete if every sufficiently large positive integer can be so expressed. \textit{J. L. Brown} [Am. Math. Mon. 68, 557--560 (1961; Zbl 0115.04305)] gave a simple necesary and sufficient condition for a sequence to be complete. Using the greedy algorithm the authors here examine setting up conditions for specifying the initial terms of a sequence and constructing a weakly complete sequence from these data.
- On Gurevich's theorem on sequential algorithms
- Using the complete sequences for sorting natural numbers
- scientific article; zbMATH DE number 4123835 (Why is no real title available?)
- scientific article; zbMATH DE number 1300639 (Why is no real title available?)
- Structures in additive sequences
- An introduction to completeness of positive linear recurrence sequences
- scientific article; zbMATH DE number 3372095 (Why is no real title available?)
- Approximation by Egyptian fractions and the weak greedy algorithm
This page was built for publication: On weakly complete sequences formed by the greedy algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911022)
