[#R1347] Resolve the stated acceptance conditions
1Summary
List every pair (m,n) with 1<=m<n and U_mU_n square, and prove that no other pair exists. Any appeal to a primitive-divisor theorem must separately handle every excluded small index and must track valuation parity, not only the presence of a new prime.
Work on the displayed statement under its exact conventions. List every pair (m,n) with 1<=m<n and U_mU_n square, and prove that no other pair exists. Any appeal to a primitive-divisor theorem must separately handle every excluded small index and must track valuation parity, not only the presence of a new prime. Preserve source locators and any finite certificates so later work can distinguish a complete resolution from partial progress.
Reported evidence. Replay readiness: source only.
2Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: doi.org ↗, Editorial research route recorded 2026-08-01
3How it connects
Addresses
- claim
Recorded for
- problem
4Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1347",
"content_hash": null,
"slug": "pell-lucas-squareclass-collisions-next-research-step",
"type": "attempt",
"title": "Resolve the stated acceptance conditions",
"summary": "List every pair (m,n) with 1<=m<n and U_mU_n square, and prove that no other pair exists. Any appeal to a primitive-divisor theorem must separately handle every excluded small index and must track valuation parity, not only the presence of a new prime.",
"relevance": "For Square-class collisions in the Pell-Lucas sequence, record pell-lucas-squareclass-collisions-next-research-step (“Resolve the stated acceptance conditions”) documents a concrete method, search boundary, or failed route. The record states: List every pair (m,n) with 1<=m<n and U_mU_n square, and prove that no other pair exists.",
"relevance_source": "recorded",
"body": "Work on the displayed statement under its exact conventions. List every pair (m,n) with 1<=m<n and U_mU_n square, and prove that no other pair exists. Any appeal to a primitive-divisor theorem must separately handle every excluded small index and must track valuation parity, not only the presence of a new prime. Preserve source locators and any finite certificates so later work can distinguish a complete 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://doi.org/10.1515/crll.2001.080",
"locator": "Editorial research route recorded 2026-08-01"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://doi.org/10.1515/crll.2001.080",
"locator": "Editorial research route recorded 2026-08-01"
},
"relations": [
{
"slug": "R1348",
"title": "Current status and unresolved remainder",
"object_type": "claim",
"relation": "addresses",
"direction": "outgoing"
},
{
"slug": "pell-lucas-squareclass-collisions",
"title": "pell lucas squareclass collisions",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}5Provenance
View source, identifiers, and projection details
- Project
- pell-lucas-squareclass-collisions-source-review
- Locator
- Editorial research route recorded 2026-08-01
- License
- CC0-1.0
- Source
- doi.org ↗
- Public record
- R1347
- Stable alias
- pell-lucas-squareclass-collisions-next-research-step
- Projection
- Reproduction fields are derived from the immutable record.
A route someone took, recorded so the next person can reuse it or avoid it.