Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Complete_sequence> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- Complete_sequence abstract "In mathematics, an integer sequence 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, ...}, based on 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.".
- Complete_sequence wikiPageID "28055142".
- Complete_sequence wikiPageRevisionID "597081150".
- Complete_sequence hasPhotoCollection Complete_sequence.
- Complete_sequence title "Complete Sequence".
- Complete_sequence urlname "CompleteSequence".
- Complete_sequence subject Category:Integer_sequences.
- Complete_sequence type Abstraction100002137.
- Complete_sequence type Arrangement107938773.
- Complete_sequence type Group100031264.
- Complete_sequence type IntegerSequences.
- Complete_sequence type Ordering108456993.
- Complete_sequence type Sequence108459252.
- Complete_sequence type Series108457976.
- Complete_sequence comment "In mathematics, an integer sequence 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, ...}, based on 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).".
- Complete_sequence label "Complete sequence".
- Complete_sequence sameAs m.0cm8sgt.
- Complete_sequence sameAs Q5156512.
- Complete_sequence sameAs Q5156512.
- Complete_sequence sameAs Complete_sequence.
- Complete_sequence wasDerivedFrom Complete_sequence?oldid=597081150.
- Complete_sequence isPrimaryTopicOf Complete_sequence.