TheoremDB
R688claimStatus: supportedEvidence: SupportedReplay: source only

[#R688] Two residue classes are settled 2-adically

claim. The published 2-adic formula proves \(H_n\ne0\) for \(n\equiv0,1\pmod3\), while the remaining universal case \(H_{3m+2}\ne0\) for every \(m\ge3\) remains open despite reported modular certificates through order 5,000.

View evidenceOpen source ↗

1Summary

Put \(u_n=(1-r_n)/2\) and \(v_k=u_k+u_{k+2}\pmod2\). Elementary row and column operations give \[ \frac{H_n(r)}{(-2)^{n-1}}\equiv H_{n-1}(v)\pmod2. \] The generating series \(V(x)=\sum v_kx^k\) obeys \[ x^2(1+x)V^2+(1+x)^2V+x=0 \] over \(\mathbb F_2\). Its periodic Hankel continued fraction has valuation parameters \((1,0)^*\). Han's Theorem 2.1 then says that \(H_m(v)\) is nonzero exactly when \(m\not\equiv1\pmod3\). Thus the displayed quotient is odd for \(n\equiv0,1\pmod3\).

This reduction is an editorial derivation from Han's theorem and should receive independent proof review. It reduces the original question to orders \(n=3m+2\), beginning with \(n=11\).

Supported evidence. Recorded scope: all positive orders congruent to 0 or 1 modulo 3.

2Evidence

Evidence package: source only

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

Verification source: irma.math.unistra.fr ↗, Guo-Niu Han, Hankel continued fraction and its applications, Theorem 2.1 and Algorithm 3.3; reduction derived for this entry

3How it connects

Tested by

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": "R688",
  "content_hash": null,
  "slug": "rsh-claim-two-residue-classes",
  "type": "claim",
  "title": "Two residue classes are settled 2-adically",
  "summary": "The published 2-adic formula proves \\(H_n\\ne0\\) for \\(n\\equiv0,1\\pmod3\\), while the remaining universal case \\(H_{3m+2}\\ne0\\) for every \\(m\\ge3\\) remains open despite reported modular certificates through order 5,000.",
  "relevance": "For Nonvanishing of Rudin-Shapiro Hankel determinants, record rsh-claim-two-residue-classes (“Two residue classes are settled 2-adically”) records a bound, answer, status fact, or structural consequence. The record states: The published 2-adic formula proves \\(H_n\\ne0\\) for \\(n\\equiv0,1\\pmod3\\), while the remaining universal case \\(H_{3m+2}\\ne0\\) for every \\(m\\ge3\\) remains open despite reported modular certificates through order 5,000.",
  "relevance_source": "recorded",
  "body": "Put \\(u_n=(1-r_n)/2\\) and \\(v_k=u_k+u_{k+2}\\pmod2\\). Elementary row and column operations give\n\\[\n\\frac{H_n(r)}{(-2)^{n-1}}\\equiv H_{n-1}(v)\\pmod2.\n\\]\nThe generating series \\(V(x)=\\sum v_kx^k\\) obeys\n\\[\nx^2(1+x)V^2+(1+x)^2V+x=0\n\\]\nover \\(\\mathbb F_2\\). Its periodic Hankel continued fraction has valuation parameters \\((1,0)^*\\). Han's Theorem 2.1 then says that \\(H_m(v)\\) is nonzero exactly when \\(m\\not\\equiv1\\pmod3\\). Thus the displayed quotient is odd for \\(n\\equiv0,1\\pmod3\\).\n\nThis reduction is an editorial derivation from Han's theorem and should receive independent proof review. It reduces the original question to orders \\(n=3m+2\\), beginning with \\(n=11\\).",
  "status": "supported",
  "evidence_grade": "sourced",
  "scope": {
    "kind": "family",
    "statement": "all positive orders congruent to 0 or 1 modulo 3",
    "family": "n congruent to 0 or 1 modulo 3"
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://irma.math.unistra.fr/~guoniu/papers/p94hfrac.pdf",
      "locator": "Guo-Niu Han, Hankel continued fraction and its applications, Theorem 2.1 and Algorithm 3.3; reduction derived for this entry"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://irma.math.unistra.fr/~guoniu/papers/p94hfrac.pdf",
    "locator": "Guo-Niu Han, Hankel continued fraction and its applications, Theorem 2.1 and Algorithm 3.3; reduction derived for this entry"
  },
  "relations": [
    {
      "slug": "R687",
      "title": "Published binary formulas do not settle the signed determinant",
      "object_type": "claim",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R684",
      "title": "Exact signed determinant sweep through order 110",
      "object_type": "artifact",
      "relation": "tests",
      "direction": "incoming"
    },
    {
      "slug": "R686",
      "title": "Settle the remaining orders congruent to 2 modulo 3",
      "object_type": "attempt",
      "relation": "uses",
      "direction": "incoming"
    },
    {
      "slug": "rudin-shapiro-hankel-nonvanishing",
      "title": "rudin shapiro hankel nonvanishing",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

5Provenance

View source, identifiers, and projection details
Project
rudin-shapiro-hankel-nonvanishing
Locator
Guo-Niu Han, Hankel continued fraction and its applications, Theorem 2.1 and Algorithm 3.3; reduction derived for this entry
License
CC0-1.0
Contributors
TheoremDB entry research, 2026-07-24
Public record
R688
Stable alias
rsh-claim-two-residue-classes
Projection
Reproduction fields are derived from the immutable record.

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

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.