Primes p ≤ N with N − p an almost prime sum of two squares (Ω ≤ 9): paper, semi-linear vector sieve with Richert weights and switching, and an interval-arithmetic certification script.
-
Updated
Oct 4, 2026 - TeX
Primes p ≤ N with N − p an almost prime sum of two squares (Ω ≤ 9): paper, semi-linear vector sieve with Richert weights and switching, and an interval-arithmetic certification script.
N = n₁ + n₂ with n₁, n₂ sums of two squares (or values of any class number one form) and Ω(n₁n₂) ≤ 11, max Ω(nᵢ) ≤ 8: paper, linear vector sieve with switching and Richert weights, interval-arithmetic certification.
Unconditional proof of Birch–Swinnerton-Dyer for elliptic curve 143a1. h(ℚ(√-143)) = 10 proved. Rank = ord_L = 1 proved. BSD formula proved. Lean 4. 0 sorry. 0 axiom. 0 gaps.
To associate your repository with the binary-quadratic-forms topic, visit your repo's landing page and select "manage topics."