Behrend's theorem is a result in arithmetic combinatorics stating that any subset of the integers from 1 to n in which no member is a multiple of any other member must have a logarithmic density that tends to zero as n grows large. The theorem is named for Felix Behrend, who published it in 1935. 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
StatementThe subsets of the integers from 1 to n in which no member of the set is a multiple of any other must have a logarithmic density that goes to zero as n becomes large. 1 Classification
Statement Form Connections
Has Statement Form
In Branch
Source Behrend's theorem (Wikipedia)
Principal Result Of
Source Felix Behrend (Wikipedia)
Proved By
Source Behrend's theorem (Wikipedia)
Sources
1. Behrend's theorem (Wikipedia)
History
This theorem is known as Behrend's theorem because Felix Behrend proved it in 1934, and published it in 1935.
History
Felix Behrend proved it in 1934, and published it in 1935
Proved By: Felix Behrend, Lead sentence
The theorem is named after Felix Behrend, who published it in 1935.
In Branch: Combinatorics, Lead sentence
In arithmetic combinatorics, Behrend's theorem states that the subsets of the integers from 1 to n in which no member of the set i
View the SourceFelix Behrend (Wikipedia)
Principal Result Of: Felix Behrend, LeadQuote, Principal Result Of: Felix Behrend, Lead
Behrend's theorem and Behrend sequences are named after him.
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.