Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5156512> ?p ?o }
Showing triples 1 to 20 of
20
with 100 triples per page.
- Q5156512 subject Q5519261.
- Q5156512 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, ...}, 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.".
- Q5156512 wikiPageWikiLink Q1136880.
- Q5156512 wikiPageWikiLink Q1188392.
- Q5156512 wikiPageWikiLink Q2259070.
- Q5156512 wikiPageWikiLink Q2297602.
- Q5156512 wikiPageWikiLink Q230967.
- Q5156512 wikiPageWikiLink Q2633.
- Q5156512 wikiPageWikiLink Q370251.
- Q5156512 wikiPageWikiLink Q3913.
- Q5156512 wikiPageWikiLink Q395.
- Q5156512 wikiPageWikiLink Q47577.
- Q5156512 wikiPageWikiLink Q49008.
- Q5156512 wikiPageWikiLink Q504353.
- Q5156512 wikiPageWikiLink Q5519261.
- Q5156512 wikiPageWikiLink Q5532425.
- Q5156512 wikiPageWikiLink Q632546.
- Q5156512 wikiPageWikiLink Q7107841.
- Q5156512 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, ...}, 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).".
- Q5156512 label "Complete sequence".