TheoremDB

Problem packetResearch packetR701

R701Recorded attemptOutcome: Open

Determine the growth order of the triangular-game P-positions

View evidenceOpen source ↗
Link to a section

Authored summary

The density question is settled, while the size of \(P\cap[1,N]\) remains a sharper quantitative target.

The recorded evidence grade has no defined assessment here. The outcome applies to this attempt's recorded scope.

Attempt outcome: open strategy

Recorded scope: No scope is recorded.

Originating problem: Density of losing positions in the subtract-a-triangular game

Authored record and scope
Authored title
Determine the growth order of the triangular-game P-positions
Record type
attempt
Stored status
open_strategy
Evidence grade
proposed

Work and source credit

Recorded action

No action description supplied.

Authored result summary

The density question is settled, while the size of \(P\cap[1,N]\) remains a sharper quantitative target.

Reported outcome

No separate outcome supplied.

Recorded status

open_strategy

Recorded evidence grade

proposed

Recorded scope

No explicit scope supplied.

This is the build snapshot. Current public contributor and model credit appears after the live record is read.

Recognized embedded source files (0)

This inventory recognizes embedded source fields. It does not fetch linked files, execute code or establish reproducibility. Complete artifacts and replay controls remain below.

The outcome reports what was recorded. Its scope and evidence grade remain separate. Read the argument and verification evidence before relying on the result.

2Authored explanation

Let \(T(N)\) be the number of positive triangular numbers at most \(N\). Maximality of the P-position set gives \((L(N)+1)(T(N)+1)\geq N+1\), hence \(L(N)=\Omega(\sqrt N)\). Polynomial recurrence gives \(L(N)=o(N)\). The computation through 200,000 is compatible with a much smaller order than the linear scale. Establishing a sharp exponent or asymptotic for this greedy triangular-difference-free set is a possible replacement question. Its novelty needs a separate literature review.

Continue this work
Replay material: source only

3Outcome

Replay package: source only

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

Verification source: oeis.org ↗, Quantitative refinement of the sequence recorded as OEIS A030194

4How it connects

Recorded for

Machine-readable record

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

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R701",
  "content_hash": null,
  "slug": "sat-attempt-growth-order",
  "type": "attempt",
  "title": "Determine the growth order of the triangular-game P-positions",
  "summary": "The density question is settled, while the size of \\(P\\cap[1,N]\\) remains a sharper quantitative target.",
  "relevance": "This records a line of attack on the target problem, including what it establishes and where it stops.",
  "relevance_source": "derived",
  "body": "Let \\(T(N)\\) be the number of positive triangular numbers at most \\(N\\). Maximality of the P-position set gives \\((L(N)+1)(T(N)+1)\\geq N+1\\), hence \\(L(N)=\\Omega(\\sqrt N)\\). Polynomial recurrence gives \\(L(N)=o(N)\\). The computation through 200,000 is compatible with a much smaller order than the linear scale. Establishing a sharp exponent or asymptotic for this greedy triangular-difference-free set is a possible replacement question. Its novelty needs a separate literature review.",
  "status": "open_strategy",
  "evidence_grade": "proposed",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://oeis.org/A030194",
      "locator": "Quantitative refinement of the sequence recorded as OEIS A030194"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://oeis.org/A030194",
    "locator": "Quantitative refinement of the sequence recorded as OEIS A030194"
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R702",
      "title": "Subtract-a-triangular losing positions have density zero",
      "object_type": "claim",
      "relation": "uses",
      "direction": "outgoing"
    },
    {
      "slug": "R700",
      "title": "Exact subtract-a-triangular sweep through 200,000",
      "object_type": "artifact",
      "relation": "uses",
      "direction": "outgoing"
    },
    {
      "slug": "subtract-a-triangular-density",
      "title": "subtract a triangular density",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details

A route someone took, recorded so the next person can reuse it or avoid 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.