1 unstable release
Uses old Rust 2015
|0.1.0||Oct 24, 2015|
#11 in #number-theory
This will be a growing collection of helpful math functions and algorythems all of which will be abstracted into generic types.
Install and initialize with
extern crate tcorp_math_mods; use tcorp_math_mods::factors;
Special thanks to Kendall at http://stackoverflow.com/questions/110344/algorithm-to-calculate-the-number-of-divisors-of-a-given-number for the fastest factorization algorithm ever. Both functions rely on a ported and slightly modified version.
There are two methods currently.
The first is number_of_factors(n:T) which returns the number of factors for parameter n in the same type as parameter n.
let x: u32 = 7; assert_eq!(factors::number_of_factors(x), 2); // Will pass and the return type will be u32
The second function is factors_for(n:T) which returns a vector of all factors for a given n.
let x: i64 = 100; assert_eq!(factors::factors_for(x), ); // Will pass and the return type will be Vec<i64>