erdos-problems 0.3.3 → 0.3.5

package/package.json

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

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

@@ -37,6 +37,10 @@ What success would look like:
 - 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..3000`
+- a direct jump to `1..5000` no longer looks cheap enough to treat as the default next move
+
 What this lane is not:
 - not brute force to `2.64 x 10^17`
 - not an automatic endorsement of every public verification claim

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

@@ -0,0 +1,55 @@
+# Problem 848 Exact Small-`N` Certificate: `1..3000`
+
+This is the first exact bounded-verification certificate frozen in the repo for Problem `848`.
+
+## Claim
+
+For every `N` with `1 <= N <= 3000`, 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`
+or `18 mod 25` residue class in `[N]`.
+
+This certificate only covers the interval `1..3000`.
+
+## 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 3000 \
+  --json-output packs/number-theory/problems/848/EXACT_SMALL_N_1_3000_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..3000`
+- result: verified
+- every scanned `N` satisfied:
+  - `max_clique_size = max(|{n in [N] : n equiv 7 mod 25}|, |{n in [N] : n equiv 18 mod 25}|)`
+
+The machine-readable result packet is:
+- `EXACT_SMALL_N_1_3000_RESULTS.json`
+
+## Scope warning
+
+This does **not** certify anything above `3000`.
+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