Repository for the FermulerPy core package. Fermulerpy is useful for problems related to various fields of Number Theory.

Object-oriented continued fractions with Python.

Code for the computation of paramodular forms via lattice methods

An algorithm that computes modular nested exponentiation efficiently.

A Formal Proof of the Irrationality of the Euler-Mascheroni Constant.

A Formally Verified Structural Parity Proof of the Collatz Conjecture.

A Formal Proof of the Non-Existence of Odd Perfect Numbers for Euler Primes p ≥ 5 via Structural Divisibility Constraints.

A module for basic math in the general vicinity of computational number theory.

Distributed prime number discovery platform — 12 search forms, deterministic proofs, fleet coordination, real-time dashboard. Built with Rust + GMP + Rayon.

A multithreaded Python3 implementation of Miller-Rabin probabilistic primality testing.

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.

Validated curvature signal for integer structural classification. κ(n) = d(n)·ln(n)/e² separates primes from composites at 3.05× ratio with 88.2% hold-out accuracy. Core signal layer of the Z Framework. Includes CDL API, adaptive threshold protocol, Z-normalization, and falsification experiments. Active research: v-inference.

A low-level C implementation of the algorithms to compute class polynomials. Mirrored from Andrew Sutherland's MIT page with additional functionality bolted on.

Prime number visualisation

A Thermodynamic Heuristic Framework for the Birch and Swinnerton-Dyer Conjecture

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.