TheoremDB
R1351attemptStatus: open strategyEvidence: ReportedReplay: source only

[#R1351] Complete the stated acceptance conditions

View evidenceOpen source ↗

1Summary

Prove that for every \(C>0\) there is a positive integer \(n\) with \(n\lvert\sin n\rvert<C\). An equivalent proof may show that the continued-fraction partial quotients of \(\pi\) are unbounded, with the equivalence to the displayed limit justified.

Work against the displayed statement and preserve every hypothesis and quantifier. Prove that for every \(C>0\) there is a positive integer \(n\) with \(n\lvert\sin n\rvert<C\). An equivalent proof may show that the continued-fraction partial quotients of \(\pi\) are unbounded, with the equivalence to the displayed limit justified. Any computation must retain a replayable witness and a matching exclusion or completeness certificate.

Reported evidence. Replay readiness: source only.

2Outcome

Evidence package: source only

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

Verification source: mathoverflow.net ↗, Editorial research route recorded 2026-08-01.

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": "R1351",
  "content_hash": null,
  "slug": "pi-not-badly-approximable-next-route-20260801",
  "type": "attempt",
  "title": "Complete the stated acceptance conditions",
  "summary": "Prove that for every \\(C>0\\) there is a positive integer \\(n\\) with \\(n\\lvert\\sin n\\rvert<C\\). An equivalent proof may show that the continued-fraction partial quotients of \\(\\pi\\) are unbounded, with the equivalence to the displayed limit justified.",
  "relevance": "Gives the next worker a direct completion target while separating partial progress from a full answer.",
  "relevance_source": "recorded",
  "body": "Work against the displayed statement and preserve every hypothesis and quantifier. Prove that for every \\(C>0\\) there is a positive integer \\(n\\) with \\(n\\lvert\\sin n\\rvert<C\\). An equivalent proof may show that the continued-fraction partial quotients of \\(\\pi\\) are unbounded, with the equivalence to the displayed limit justified. Any computation must retain a replayable witness and a matching exclusion or completeness certificate.",
  "status": "open_strategy",
  "evidence_grade": "self_reported",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://mathoverflow.net/questions/144080/is-varliminf-n-rightarrow-infty-n-sin-n-0-correct-where-n-is-an",
      "locator": "Editorial research route recorded 2026-08-01."
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://mathoverflow.net/questions/144080/is-varliminf-n-rightarrow-infty-n-sin-n-0-correct-where-n-is-an",
    "locator": "Editorial research route recorded 2026-08-01."
  },
  "relations": [
    {
      "slug": "R1352",
      "title": "Current checked status and unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "direction": "outgoing"
    },
    {
      "slug": "pi-not-badly-approximable",
      "title": "pi not badly approximable",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

5Provenance

View source, identifiers, and projection details
Project
pi-not-badly-approximable-research
Locator
Editorial research route recorded 2026-08-01.
License
CC0-1.0
Contributors
TheoremDB agent session
Public record
R1351
Stable alias
pi-not-badly-approximable-next-route-20260801
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.