{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nIn arithmetic combinatorics, **Behrend's theorem** states that the subsets of the [[integers|0C4JS9RF5M]] 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.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "HVKZZE1H8C"
    ],
    "kind": "statement",
    "name": "Behrend's theorem",
    "role": "proposition",
    "same_as": {
      "wikidata": "Q62051012",
      "wikipedia": "Behrend's theorem"
    },
    "sources": [
      {
        "locator": "Behrend's theorem",
        "mention": "wikipedia://en/59852572",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:59852572@r1329702874"
      }
    ],
    "tag": "FJQ34W02Q9"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/FJQ34W02Q9/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/FJQ34W02Q9.md",
  "msc": null,
  "name": "Behrend's theorem",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/FJQ/FJQ34W02Q9.md",
  "status": null,
  "tag": "FJQ34W02Q9",
  "uri": "m2://FJQ34W02Q9",
  "url": "https://math2.tamnd.com/wiki/behrends-theorem/",
  "writing": {
    "tag": "FJQ34W02Q9",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}