Behrend's theorem
Statement
In arithmetic combinatorics, Behrend's theorem states that the subsets of the integers from 1 to in which no member of the set is a multiple of any other must have a logarithmic density that goes to zero as becomes large. The theorem is named after Felix Behrend, who published it in 1935.
Further reading
- Wikipedia, page 59852572, revision 1329702874, Behrend's theorem. adopted
About this page
| Tag | FJQ34W02Q9 |
|---|---|
| URI | m2://FJQ34W02Q9 |
| Kind | statement, proposition |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status FJQ34W02Q9. |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- edge uses out: each definition that the statement needs (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.