Function mad_compression

pub fn mad_compression(key: usize, len: usize) -> usize

Illustrates MAD compression as [(ai + b) mod p] mod N Relies on is_prime and next_prime functions c(h(k)) = ((a * h(k) + b) mod p) mod N