smooth-numbers 0.4.1

Algorithms to generate smooth numbers
Documentation

smooth-numbers

Algorithms to generate smooth numbers

crates.io docs.rs GitHub GitHub Workflow Status Dependencies status MIT license

Example

Compute the first 10 numbers whose prime factors are only 2 and 5:

use smooth_numbers::*;

assert_eq!(
    with_primes(&[2, 5], 10),
    [1, 2, 4, 5, 8, 10, 16, 20, 25, 32]
);