Question

How to find the smallest number that is evenly divisible by all of the numbers from 1 to 10 in Rust

Answer 1

fn lcm(a: u32, b: u32) -> u32 {
    let mut lmc = std::cmp::max(a, b); // Start with the greater of the two numbers

    // Loop indefinitely until we find the LCM
    while lmc % a != 0 || lmc % b != 0 {
        lmc += 1; // Increment and check the next number
    }

    lmc // Return the LCM
}

fn main() {
    let mut result = 1;

    // Iterate through numbers 1 to 10
    for i in 1..=10 {
        result = lcm(result, i); // Update result with LCM of current range
    }

    // Output the final LCM of numbers from 1 to 10
    println!(
        "The Least Common Multiple (LCM) of numbers from 1 to 10 is: {}",
        result
    );
}


 
 
/*
run:
 
The Least Common Multiple (LCM) of numbers from 1 to 10 is: 2520

*/

 

70+ SQL courses for beginners and professionals