Skip to content
#

computational-number-theory

Here are 45 public repositories matching this topic...

Investigates deterministic prime-gap interiors using the Divisor Normalization Identity (DNI). Establishes the Gap Winner Rule (GWR) the raw-Z maximizer is always the leftmost min-d(n) carrier. Validates the No-Later-Simpler-Composite Theorem with zero violations through 10^18. Documents hierarchical first-arrival laws and square-phase terminal.

  • Updated Aug 16, 2026
  • Python

A finite algebraic covering system for the Erdos-Straus conjecture, verified to 10^11 (max A = 359); exploratory search to 1.2x10^12 finds A = 479. Gateway decompositions via divisors of N^2.

  • Updated Aug 1, 2026
  • Python

Improve this page

Add a description, image, and links to the computational-number-theory topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

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

Learn more