Question

How to calculate the LCM (Least Common Multiple) of two numbers using recursion in C++

Answer 1

#include <iostream>
 
int getLMC_Recursion(int a, int b) {
    static int lmc = 1;
  
    if (lmc % a == 0 && lmc % b == 0) {
        return lmc;
    }
    lmc++;
     
    getLMC_Recursion(a, b);
    
    return lmc;
}
  
int main() {
    int a = 12, b = 20;
      
    std::cout << "The LCM (Least Common Multiple) of " << a << " and " << b << " is: " << getLMC_Recursion(a, b);
    
    return 0;
}
  
  
    
   
/*
run:
   
The LCM (Least Common Multiple) of 12 and 20 is: 60
   
*/

 

Cleaner teeth, healthier you!
Get The Secret to a Bright and Healthy Smile