erdos-problems 0.3.2 → 0.3.4

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "erdos-problems",
-  "version": "0.3.2",
+  "version": "0.3.4",
   "description": "CLI atlas and workspace tools for Paul Erdos problems.",
   "type": "module",
   "bin": {

package/packs/number-theory/problems/848/BOUNDED_VERIFICATION_PLAN.md

@@ -0,0 +1,46 @@
+# Problem 848 Bounded Verification Plan
+
+This note chooses the next closure lane for Problem `848`.
+
+Chosen lane:
+- bounded finite verification under the best trusted explicit threshold currently available
+
+Reason for this choice:
+- `848` is already a decidable-gap problem, not a fresh asymptotic frontier
+- the imported public thread currently reaches `N0 = 2.64 x 10^17` on 2026-03-23
+- lowering `N0` further is still valuable, but only because it reduces the finite remainder
+- a structured verification program is closer to the actual finish line than another isolated
+  threshold race
+
+Scope of this lane:
+- do not claim full closure yet
+- do not silently adopt imported threshold claims as canonical repo truth
+- instead, build the machinery that would let the repo:
+  - state exactly what range is covered by what method
+  - preserve certificates and checkpoints
+  - audit imported verification claims before relying on them
+
+Immediate bounded-verification objectives:
+1. Freeze the best imported threshold currently trusted enough to size the finite remainder.
+2. Split the finite remainder into verification regimes rather than treating it as one giant
+   interval.
+3. Define what a reproducible verification certificate must contain before the repo counts a
+   range as covered.
+4. Record prior public verification attempts, especially where external reviewers raised
+   correctness concerns.
+5. Keep the verification lane modular enough that imported proofs, local proofs, and future
+   compute runs can all plug into the same certificate surface.
+
+What success would look like:
+- the repo can say exactly which interval is covered
+- each covered interval points to a concrete certificate type and reproduction story
+- imported public verification work is either accepted with an audit note or left external
+- the remaining uncovered range shrinks monotonically
+
+Current progress:
+- the repo now has an exact small-`N` certificate for `1..2000`
+
+What this lane is not:
+- not brute force to `2.64 x 10^17`
+- not an automatic endorsement of every public verification claim
+- not a replacement for threshold-lowering work if a cleaner explicit `N0` emerges

package/packs/number-theory/problems/848/BRANCH_COMPARISON_LEDGER.md

@@ -0,0 +1,85 @@
+# Problem 848 Branch Comparison Ledger
+
+This note closes `N848.G1.A8`.
+
+Question:
+- does the current shared witness
+  - `T = 250`
+  - `N >= exp(1420)`
+  - `eta = 10^-4`
+
+already dominate the other public case bounds in Sawhney's proof?
+
+Answer:
+- yes, at the repo's current explicit level it does
+
+## Shared witness inputs
+
+From the existing explicit notes:
+- weakest-branch main term: `0.0376113079`
+- `A*` tail at `T = 250`: `0.0005641453`
+- two-class Lemma 2.2 tail at `T = 250`: `0.0000491054`
+- one-class prime-count term at `N >= exp(1420)`: at most `1 / (1420 - 1.1)`
+- two-class prime-count term at `N >= exp(1420)`: at most `2 / (1420 - 1.1)`
+
+These are enough to compare the other public branches without changing the witness.
+
+## Case `0.0358`
+
+Repo explicit bound at the shared witness:
+- main term about `0.0356925181`
+- visible tail terms about `0.0002943490`
+- one-class prime-count term about `0.0007047713`
+
+Total visible bound:
+- about `0.0366916384`
+
+Visible reserve to `0.04`:
+- about `0.0033083616`
+
+## Case `0.0336`
+
+Repo explicit bound at the shared witness:
+- main term about `0.0334753577`
+- visible tail terms about `0.0003311781`
+- two-class prime-count term about `0.0014095427`
+
+Total visible bound:
+- about `0.0352160784`
+
+Visible reserve to `0.04`:
+- about `0.0047839216`
+
+## Case `0.0294`
+
+Repo explicit bound at the shared witness:
+- main term about `0.0293394076`
+- visible tail terms about `0.0000491054`
+- two-class prime-count term about `0.0014095427`
+
+Total visible bound:
+- about `0.0307980556`
+
+Visible reserve to `0.04`:
+- about `0.0092019444`
+
+## Honest comparison conclusion
+
+At the repo's current explicit level:
+- the `0.0377` branch remains the tightest branch
+- but it is already closed by the shared witness
+- the branches `0.0358`, `0.0336`, and `0.0294` all retain strictly larger visible reserve
+
+So the current witness appears to be a whole-proof witness candidate, not just a
+weakest-branch patch.
+
+## Remaining caution
+
+This is still a repo witness ledger, not yet a publication-ready explicit-threshold proof.
+
+What remains:
+- package the whole argument as a proposition-level explicit candidate
+- decide whether to state `N0 <= exp(1420)` as the current repo witness, or to keep it as a
+  claim-safe candidate pending a cleaner writeup
+
+But the route no longer points to another hidden branch obstruction.

package/packs/number-theory/problems/848/CERTIFIED_NUMERICAL_LEDGER.md

@@ -0,0 +1,88 @@
+# Problem 848 Certified Numerical Ledger
+
+This note closes `N848.G1.A11`.
+
+Purpose:
+- replace the displayed decimal inputs used in the current witness with conservative machine
+  intervals
+
+Scope:
+- this is still a repo-level certification note, not a formal proof-assistant artifact
+- the goal is to eliminate naked decimal approximations from the current witness candidate
+
+## Method
+
+Cutoff:
+- enumerate primes up to `5,000,000`
+
+For the Euler-product main terms:
+- multiply the truncated product in machine arithmetic
+- apply a conservative relative rounding envelope `n * eps / (1 - n * eps)` where `n` is the
+  number of factors and `eps = 2^-52`
+- apply a missing-tail lower bound using
+  - `sum_{p > P} 2 / p^2 <= 2 / P` for the `A*` product
+  - `sum_{p > P} 1 / p^2 <= 1 / P` for the `A7 union A18` product
+
+For the tail sums:
+- sum the prime-square reciprocals up to the same cutoff
+- add both a summation-error envelope and the missing-tail envelope `1 / P`
+
+## Certified upper bounds used by the witness
+
+### 1. `A*` main term
+
+Certified upper bound:
+- `A* main <= 0.0251591225`
+
+### 2. `A7 union A18` main term
+
+Certified upper bound:
+- `A7 union A18 main <= 0.0124525569`
+
+### 3. `A*` tail at `T = 250`
+
+Certified upper bound:
+- `A* tail <= 0.0005641454`
+
+### 4. Two-class Lemma 2.2 tail at `T = 250`
+
+Certified upper bound:
+- `Lemma 2.2 tail <= 0.0000491055`
+
+### 5. Two-class prime-count term at `N >= exp(1420)`
+
+From `LEMMA22_PRIME_COUNT_BOUND.md`:
+- `2 pi(N) / N <= 0.0014095427`
+
+## Certified weakest-branch witness
+
+Using only the certified upper bounds above, the weakest branch satisfies
+
+- `|A| / N <= 0.0396344729`
+
+for the shared witness scale
+- `N >= exp(1420)`
+- `T = 250`.
+
+So the certified visible reserve to `1/25 = 0.04` is at least
+
+- `0.04 - 0.0396344729 = 0.0003655271`.
+
+After the working choice
+- `eta = 10^-4`,
+
+the certified visible reserve is still at least
+
+- `0.0002655271`.
+
+## Honest consequence
+
+This note removes the main numerical discomfort in the current repo candidate:
+- the witness no longer depends only on display decimals copied from exploratory notes
+
+What it still does **not** provide:
+- a formal proof-assistant certificate
+- a publication-ready theorem writeup
+
+But it does mean the current route can now treat the witness as numerically hardened at the
+repo level.

package/packs/number-theory/problems/848/EXACT_SMALL_N_1_2000_CERTIFICATE.md

@@ -0,0 +1,55 @@
+# Problem 848 Exact Small-`N` Certificate: `1..2000`
+
+This is the first exact bounded-verification certificate frozen in the repo for Problem `848`.
+
+## Claim
+
+For every `N` with `1 <= N <= 2000`, the maximum size of a set `A subseteq [N]` such that
+`ab + 1` is never squarefree for all `a, b in A` is equal to the size of the `7 mod 25`
+residue class in `[N]`.
+
+This certificate only covers the interval `1..2000`.
+
+## Method class
+
+- `exact_small_n`
+
+## Reproduction
+
+Command used:
+
+```bash
+node packs/number-theory/problems/848/compute/problem848_small_n_exact_scan.mjs \
+  --min 1 \
+  --max 2000 \
+  --json-output packs/number-theory/problems/848/EXACT_SMALL_N_1_2000_RESULTS.json
+```
+
+The script:
+- filters vertices by the loop condition `a^2 + 1` not squarefree
+- builds the compatibility graph where `a` and `b` are adjacent exactly when `ab + 1` is not
+  squarefree
+- computes an exact maximum clique for each `N`
+- compares that maximum clique size against the `7 mod 25` class size
+
+## Outcome
+
+- interval: `1..2000`
+- result: verified
+- every scanned `N` satisfied:
+  - `max_clique_size = |{n in [N] : n equiv 7 mod 25}|`
+
+The machine-readable result packet is:
+- `EXACT_SMALL_N_1_2000_RESULTS.json`
+
+## Scope warning
+
+This does **not** certify anything above `2000`.
+It is a base interval certificate only.
+
+## Why this interval matters
+
+- it creates a real in-repo covered interval, not just a verification plan
+- it is large enough to be a meaningful finite-check foothold
+- it does not rely on disputed public computation
+- it gives the bounded-verification lane a concrete certificate format and reproduction path