numbers_rus 1.0.0

Number-theory primitives and exact arithmetic for Rust — built for competitive programming, teaching, and recreational math. Miller-Rabin primality, sieves, factorization, modular arithmetic, generic rationals, complex numbers, and polynomials.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14

//! Integer algorithms, grouped by family.
//!
//! - [`primes`] — primality testing, sieves, factorization.
//! - [`arith`] — GCD/LCM, modular exponentiation, modular inverse, CRT,
//!   Euler's totient.
//! - [`properties`] — divisor-based predicates and the general perfect-power
//!   detector.
//! - [`sequences`] — classical sequences (factorial, Fibonacci, triangular)
//!   implemented iteratively with overflow checks.

pub mod primes;
pub mod arith;
pub mod properties;
pub mod sequences;