TheoremDB

Problem packetResearch packetR1573

R1573Sourced evidence

Dated status and exact unresolved remainder

View evidenceOpen source ↗
Link to a section

Authored summary

Unresolved in this packet after the dated source check. Strongest checked result: The MathOverflow thread remains open with zero answers, and the checked OEIS records still present the infinitude of ones as an unresolved question. No later proof or counterexample was located. Exact unresolved remainder: Prove that for every integer N there exists m>N with a_m=1, or prove that a_m is never 1 beyond an explicit index. Any computational component must use exact integer recurrence checks and publish the verified prefix length, code revision, and a digest of the resulting occurrence list.

The record cites sources for its explanation.

Recorded status: reported

Recorded scope: No scope is recorded.

Originating problem: Infinitely many ones in the greedy three-term-progression-free sequence

Authored record and scope
Authored title
Dated status and exact unresolved remainder
Record type
claim
Stored status
reported
Evidence grade
sourced

2Authored explanation

The packet's cited sources and equivalent formulations were checked in the dated review recorded below.

Strongest checked result: The MathOverflow thread remains open with zero answers, and the checked OEIS records still present the infinitude of ones as an unresolved question. No later proof or counterexample was located.

Exact unresolved remainder: Prove that for every integer N there exists m>N with a_m=1, or prove that a_m is never 1 beyond an explicit index. Any computational component must use exact integer recurrence checks and publish the verified prefix length, code revision, and a digest of the resulting occurrence list.

Continue this work
Replay material: source only

3Evidence

Replay package: source only

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

Verification source: mathoverflow.net ↗, Full question, answers, and visible comments concerning Infinitely many ones in the greedy three-term-progression-free sequence; checked 2026-08-01.

4What was measured

5How it connects

Replaces

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1573",
  "content_hash": null,
  "slug": "grahl-sequence-infinitely-many-ones-status-packet-quality-20260801",
  "type": "claim",
  "title": "Dated status and exact unresolved remainder",
  "summary": "Unresolved in this packet after the dated source check. Strongest checked result: The MathOverflow thread remains open with zero answers, and the checked OEIS records still present the infinitude of ones as an unresolved question. No later proof or counterexample was located. Exact unresolved remainder: Prove that for every integer N there exists m>N with a_m=1, or prove that a_m is never 1 beyond an explicit index. Any computational component must use exact integer recurrence checks and publish the verified prefix length, code revision, and a digest of the resulting occurrence list.",
  "relevance": "For Infinitely many ones in the greedy three-term-progression-free sequence, this successor gives readable dated status prose and the exact remaining research boundary.",
  "relevance_source": "recorded",
  "body": "The packet's cited sources and equivalent formulations were checked in the dated review recorded below.\n\nStrongest checked result: The MathOverflow thread remains open with zero answers, and the checked OEIS records still present the infinitude of ones as an unresolved question. No later proof or counterexample was located.\n\nExact unresolved remainder: Prove that for every integer N there exists m>N with a_m=1, or prove that a_m is never 1 beyond an explicit index. Any computational component must use exact integer recurrence checks and publish the verified prefix length, code revision, and a digest of the resulting occurrence list.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://mathoverflow.net/questions/338415/on-the-first-sequence-without-triple-in-arithmetic-progression",
      "locator": "Full question, answers, and visible comments concerning Infinitely many ones in the greedy three-term-progression-free sequence; checked 2026-08-01."
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://mathoverflow.net/questions/338415/on-the-first-sequence-without-triple-in-arithmetic-progression",
    "locator": "Full question, answers, and visible comments concerning Infinitely many ones in the greedy three-term-progression-free sequence; checked 2026-08-01."
  },
  "models": [],
  "relations": [
    {
      "slug": "R1315",
      "title": "Current checked status and unresolved remainder",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "outgoing",
      "metadata": {
        "reason": "Replaces unreadable status prose with the dated review from 2026-08-01."
      }
    },
    {
      "slug": "grahl-sequence-infinitely-many-ones",
      "title": "grahl sequence infinitely many ones",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.