use jabba_lib::jmath;

fn main() {
    let number = 101;
    println!("{} is palindrome: {}", number, jmath::is_palindrome(number));
    let number = 1977;
    println!("{} is palindrome: {}", number, jmath::is_palindrome(number));

    println!("{} is prime: {}", number, jmath::is_prime(number as u64));

    println!("The first ten prime numbers:");
    let mut primes = jmath::Primes::new();
    for _ in 0..10 {
        println!("{}", primes.next().unwrap());
    }
    println!("---");
    let v = jmath::get_primes_below(12);
    println!("{:?}", v);
    println!("---");
    println!("divisors of 28: {:?}", jmath::get_divisors(28));
    println!("---");
    let n = 13;
    let seq = jmath::get_collatz_sequence(n);
    println!(
        "Collatz sequence of {}: {}",
        n,
        seq.iter()
            .map(|x| x.to_string())
            .collect::<Vec<_>>()
            .join(" -> ")
    );
    println!("---");
    println!("5! = {}", jmath::factorial(5));
    println!("---");
    let n = 33;
    println!("{}! = {}", n, jmath::factorial_bigint(n));
}