Moessner's theorem
id:
moessner-s-theorem-277-9951529
title:
Moessner's theorem
text:
In number theory, Moessner's theorem or Moessner's magic
is related to an arithmetical algorithm to produce an infinite sequence of the exponents of positive integers 1 n , 2 n , 3 n , 4 n , ⋯ , with n ≥ 1 , 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 n = 2 , one can remove every even number, resulting in , and then a
brand slug:
wiki
category slug:
encyclopedia
description:
Theorem in number theory
original url:
https://en.wikipedia.org/wiki/Moessner%27s_theorem
date created:
date modified:
2023-10-23T23:03:29Z
main entity:
{"identifier":"Q107634572","url":"https://www.wikidata.org/entity/Q107634572"}
image:
fields total:
13
integrity:
14