Skip to content
#

analytic-number-theory

Here are 23 public repositories matching this topic...

Certified first 1,000 nontrivial zeros of the Riemann zeta function using a dual-evaluator (mpmath ζ + η‐series) contour method with strict Krawczyk isolation and automatic refinement.

  • Updated Nov 20, 2025
  • Python

This repository contains a modular Python toolkit for studying the Riemann-Zeta function on the critical line and certifying its non-trivial zeros.

  • Updated Nov 28, 2025
  • Python

Nine-paper series introducing Constitutional Forcing — a mechanism by which algebraic structure uniquely determines governing constants across prime arithmetic, information theory, and fluid dynamics. θₖ = (2ᵏ − k)/2ᵏ. Khayyam Wakil, ARC Institute of Knowware, 2026.

  • Updated Apr 3, 2026
  • TypeScript

Closed-form nth-prime estimator built on invariant-normalization logic, with deterministic refinement and exact benchmarks across a contract grid spanning n = 10^2 to 10^24.

  • Updated Apr 9, 2026
  • Python

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 Apr 21, 2026
  • Python

Improve this page

Add a description, image, and links to the analytic-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 analytic-number-theory topic, visit your repo's landing page and select "manage topics."

Learn more