TheoremDB

Problem packetWorkR1179

R1179attemptStatus: open strategyEvidence: ReportedReplay: source only

[#R1179] Resolve the stated acceptance condition

View evidenceOpen source ↗

1Summary

Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 10: For a non-negative integer $k$, let $\mathcal{S}_k$ denote the set of natural numbers that can be written as $p + 2^{a_1} + 2^{a_2} + \cdots + 2^{a_m}$ where $p$ is a prime number, $m \leq k$, and $a_1, a_2, \ldots, a_m$ are non-negative integers (with the empty sum of powers of $2$ equal to $0$). Does there exist some $k$ such that $\mathcal{S}_k = \mathbb{N} \setminus \{0, 1\}$?

Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 10: For a non-negative integer $k$, let $\mathcal{S}_k$ denote the set of natural numbers that can be written as $p + 2^{a_1} + 2^{a_2} + \cdots + 2^{a_m}$ where $p$ is a prime number, $m \leq k$, and $a_1, a_2, \ldots, a_m$ are non-negative integers (with the empty sum of powers of $2$ equal to $0$). Does there exist some $k$ such that $\mathcal{S}_k = \mathbb{N} \setminus \{0, 1\}$? Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.

Reported evidence. Replay readiness: source only.

2Outcome

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: www.erdosproblems.com ↗, Editorial research route recorded 2026-07-31

3How it connects

Addresses

Recorded for

4Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1179",
  "content_hash": null,
  "slug": "erdos-problem-10-attempt-resolution-route",
  "type": "attempt",
  "title": "Resolve the stated acceptance condition",
  "summary": "Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 10: For a non-negative integer $k$, let $\\mathcal{S}_k$ denote the set of natural numbers that can be written as $p + 2^{a_1} + 2^{a_2} + \\cdots + 2^{a_m}$ where $p$ is a prime number, $m \\leq k$, and $a_1, a_2, \\ldots, a_m$ are non-negative integers (with the empty sum of powers of $2$ equal to $0$). Does there exist some $k$ such that $\\mathcal{S}_k = \\mathbb{N} \\setminus \\{0, 1\\}$?",
  "relevance": "For Erdős's Problem on Sums of a Prime and Powers of 2, record erdos-problem-10-attempt-resolution-route (“Resolve the stated acceptance condition”) documents a concrete method, search boundary, or failed route. The record states: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 10: For a non-negative integer $k$, let $\\mathcal{S}_k$ denote the set of natural numbers that can be written as $p + 2^{a_1} + 2^{a_2} + \\cdots + 2^{a_m}$ where $p$ is a prime number, $m \\leq k$, and $a_1, a_2, \\ldots, a_m$ are non-negative integers (with the empty sum of powers of $2$ equal to $0$).",
  "relevance_source": "recorded",
  "body": "Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 10: For a non-negative integer $k$, let $\\mathcal{S}_k$ denote the set of natural numbers that can be written as $p + 2^{a_1} + 2^{a_2} + \\cdots + 2^{a_m}$ where $p$ is a prime number, $m \\leq k$, and $a_1, a_2, \\ldots, a_m$ are non-negative integers (with the empty sum of powers of $2$ equal to $0$). Does there exist some $k$ such that $\\mathcal{S}_k = \\mathbb{N} \\setminus \\{0, 1\\}$? Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.",
  "status": "open_strategy",
  "evidence_grade": "self_reported",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://www.erdosproblems.com/10",
      "locator": "Editorial research route recorded 2026-07-31"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://www.erdosproblems.com/10",
    "locator": "Editorial research route recorded 2026-07-31"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1180",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "direction": "outgoing"
    },
    {
      "slug": "erdos-problem-10",
      "title": "erdos problem 10",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

5Provenance

View source, identifiers, and projection details
Project
erdos-problem-10-source-review
Locator
Editorial research route recorded 2026-07-31
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1179
Stable alias
erdos-problem-10-attempt-resolution-route
Projection
Reproduction fields are derived from the immutable record.

A route someone took, recorded so the next person can reuse it or avoid it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.