Function prime_checker::get_hcn

source · 
pub fn get_hcn(num: u64) -> Vec<u64>
Expand description

Find all highly composite numbers until a given value num.

WARNING: Computationally Expensive 1

Arguments:

  1. num: u64 - The number to check till.

Returns:

  1. Vec<u64> - The list of all anti-prime numbers until that number.

Example:

let anti_primes: Vec<u64> = prime_checker::get_hcn(100);

assert_eq!(anti_primes, vec![1, 2, 4, 6, 12, 24, 36, 48, 60]);

  1. Takes ~64 seconds to check ~6000 values beyond the last known anti-prime as defined in libs::constants::KNOWN_ANTIPRIMES ↩