almost-primes

Here are 2 public repositories matching this topic...

Ruqing1963 / bilateral-two-squares-sieve

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.

python latex mathematics interval-arithmetic number-theory analytic-number-theory computer-assisted-proofs imaginary-quadratic-fields sieve-methods additive-number-theory binary-quadratic-forms sums-of-two-squares almost-primes

Updated Oct 4, 2026
Python

Ruqing1963 / almost-prime-sum-of-two-squares

Star

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.

prime-numbers interval-arithmetic goldbach-conjecture analytic-number-theory computer-assisted-proofs imaginary-quadratic-fields sieve-methods binary-quadratic-forms sums-of-two-squares almost-primes

Updated Oct 4, 2026
TeX

Add this topic to your repo

To associate your repository with the almost-primes topic, visit your repo's landing page and select "manage topics."

Learn more