{
  "aliases": [
    "strong-goldbach-conjecture"
  ],
  "backlinks": null,
  "body": "\n## Statement\n\nEach even integer $n \u003e 2$ is the sum of two [[prime numbers|0SN0MAEKYX]].\n\n## Remarks\n\nFor example, $4 = 2 + 2$, $28 = 5 + 23 = 11 + 17$ and $100 = 3 + 97$.\nThe weak Goldbach conjecture says that each odd integer $n \u003e 5$ is the sum of three primes. Harald Helfgott proved it in 2013.\nThe conjecture is open. A distributed computer search checked it for each even $n \\le 4 \\cdot 10^{18}$.\n\n## History\n\nGoldbach stated a form of the conjecture in a letter to Euler in 1742.\n\n## Explanations\n\n### L1 human\n\nTake an even number larger than $2$. The conjecture says that you can always split it into two primes.\nFor example, $18 = 7 + 11$. Nobody has found an even number that fails, but nobody has a proof.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "aliases": [
      "strong-goldbach-conjecture"
    ],
    "kind": "conjecture",
    "msc": [
      "11P32"
    ],
    "name": "Goldbach's conjecture",
    "same_as": {
      "wikidata": "Q485520",
      "wikipedia": "Goldbach's conjecture"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Goldbach%27s_conjecture"
      }
    ],
    "tag": "063JNBSMJ0"
  },
  "kind": "conjecture",
  "link": "https://math2.tamnd.com/node/063JNBSMJ0/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/063JNBSMJ0.md",
  "msc": [
    "11P32"
  ],
  "name": "Goldbach's conjecture",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/063/063JNBSMJ0.md",
  "status": null,
  "tag": "063JNBSMJ0",
  "uri": "m2://063JNBSMJ0",
  "url": "https://math2.tamnd.com/wiki/goldbachs-conjecture/",
  "writing": {
    "tag": "063JNBSMJ0",
    "kind": "conjecture",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "have": 0,
        "want": 1
      }
    ]
  }
}