Skip to main content

proof_engine/number_theory/
mod.rs

1//! Number theory module for Proof Engine.
2//!
3//! Provides prime number distributions, zeta functions, modular arithmetic,
4//! continued fractions, p-adic numbers, Gaussian integers, elliptic curves,
5//! Galois fields, and classic conjectures (Collatz, Goldbach) — all with
6//! rendering primitives that map to the engine's glyph system.
7
8pub mod primes;
9pub mod zeta;
10pub mod modular;
11pub mod continued_fractions;
12pub mod padic;
13pub mod gaussian;
14pub mod elliptic;
15pub mod galois;
16pub mod collatz;
17pub mod goldbach;
18pub mod totient;
19
20pub use primes::{
21    sieve_of_eratosthenes, is_prime, nth_prime, prime_counting,
22    prime_gaps, twin_primes, prime_factorization,
23    UlamSpiral, SacksSpiral, PrimeDistributionRenderer,
24};
25pub use zeta::{Complex, zeta, zeta_on_critical_line, z_function, find_zeros};
26pub use modular::{mod_pow, mod_inverse, chinese_remainder_theorem, primitive_roots, discrete_log};
27pub use continued_fractions::ContinuedFraction;
28pub use padic::{PAdic, padic_norm, padic_distance};
29pub use gaussian::GaussianInt;
30pub use elliptic::{EllipticCurve, CurvePoint};
31pub use galois::{GaloisField, GfElement};
32pub use collatz::{collatz_sequence, collatz_stopping_time, CollatzTree};
33pub use goldbach::{goldbach_partition, goldbach_count, goldbach_comet};
34pub use totient::{totient, totient_sieve, totient_sum, sigma, tau, mobius};