The Lambek-Moser theorem, in combinatorial number theory, describes how to partition the natural numbers into two complementary sets, such as the odd and even numbers or the primes and non-primes, using a pair of non-decreasing integer functions that are inverse to each other in a specific sense. Joachim Lambek and Leo Moser published the result in 1954 as an extension of Rayleigh's theorem on complementary Beatty sequences, and it also shows every complementary partition of the natural numbers arises this way, so a formula for one set's members yields a formula for the other set's members. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement FormCharacterization Theorem 1 Connections
Has Statement Form
In Branch
Source Lambek-Moser theorem (Wikipedia)
Source Lambek-Moser theorem (Wikipedia)
Sources
1. Lambek-Moser theorem (Wikipedia)
Lead section
The Lambek-Moser theorem is a mathematical description of the partitions of natural numbers into two complementary sets.
In Group: Enumerative, Additive and Algebraic Combinatorics, Lead
The Lambek-Moser theorem is a mathematical description of the partitions of natural numbers into two complementary sets.
In Branch: Number Theory, Lead paragraph
The Lambek-Moser theorem belongs to combinatorial number theory.
In Branch: Combinatorics, Lead paragraph
The Lambek-Moser theorem belongs to combinatorial number theory.
View the Source2. Lambek-Moser theorem (Wikipedia)
The theorem was discovered by Leo Moser and Joachim Lambek, who published it in 1954View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.