In number theory, Moessner's theorem or Moessner's magicis related to an arithmetical algorithm to produce an infinite sequence of the exponents of positive integers with by recursively manipulating the sequence of integers algebraically. The algorithm was first published by Alfred Moessner in 1951; the first proof of its validity was given by Oskar Perron that same year. For example, for , one can remove every even number, resulting in , and then add each odd number to the sum of all previous elements, providing .
Property | Value |
---|---|
dbo:abstract |
|
dbo:wikiPageExternalLink | |
dbo:wikiPageID |
|
dbo:wikiPageLength |
|
dbo:wikiPageRevisionID |
|
dbo:wikiPageWikiLink | |
dbp:wikiPageUsesTemplate | |
dcterms:subject | |
rdfs:comment |
|
rdfs:label |
|
owl:sameAs | |
prov:wasDerivedFrom | |
foaf:isPrimaryTopicOf | |
is dbo:knownFor of | |
is dbo:wikiPageWikiLink of | |
is dbp:knownFor of | |
is foaf:primaryTopic of |