Lesson plan
Behrend's theorem
In arithmetic combinatorics, Behrend's theorem states that the 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. The theorem is named after Felix Behrend, who published it in 1935.
Article summary
In arithmetic combinatorics, Behrend's theorem states that the 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. The theorem is named after Felix Behrend, who published it in 1935.
Key claims
- publication date: 1935 — source: Wikipedia, revision 1329702874, retrieved 2026-10-20 · confidence 0.95
- publication date: 1935 — source: Wikipedia, revision 1329702874, retrieved 2026-10-20 · confidence 0.95
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- The record states that the publication date is "1935". What evidence would count against this claim?
- The record states that the publication date is "1935". What evidence would count against this claim?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
- Wikipedia, “Behrend's theorem”, revision 1329702874, retrieved 2026-10-20 https://en.wikipedia.org/w/index.php?oldid=1329702874
Key claims and bibliography are generated from the same tracked claims and sources as the article page.