Lambek–Moser theorem
In combinatorial number theory, the Lambek–Moser theorem is a generalization of Beatty's theorem that defines a partition of the positive integers into two subsets from any monotonic integer-valued function. Conversely, any partition of the positive integers into two subsets may be defined from a monotonic function in this way. The theorem was discovered by Leo Moser and Joachim Lambek. provides a visual proof of the result.
known for
Wikipage disambiguates
Wikipage redirect
Link from a Wikipage to another Wikipage
known for
primaryTopic
Lambek–Moser theorem
In combinatorial number theory, the Lambek–Moser theorem is a generalization of Beatty's theorem that defines a partition of the positive integers into two subsets from any monotonic integer-valued function. Conversely, any partition of the positive integers into two subsets may be defined from a monotonic function in this way. The theorem was discovered by Leo Moser and Joachim Lambek. provides a visual proof of the result.
has abstract
In combinatorial number theory ...... a visual proof of the result.
@en
Link from a Wikipage to an external page
Wikipage page ID
10,620,457
page length (characters) of wiki page
Wikipage revision ID
963,661,006
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
In combinatorial number theory ...... a visual proof of the result.
@en
label
Lambek–Moser theorem
@en