如何使用 Go 语言中的递归查找两个给定数字的最小公倍数？

package main

// fmt package provides the function to print anything
import (
   "fmt"
)

// this function is finding the GCD of two numbers with three parameters
// of int type and have a return type of int type
func gcdOfTwoNumbers(number1, number2, minNumber int) int {

   // checking if the number minNumber can divide both number1 and number2
   if minNumber == 1 || (number1%minNumber == 0 && number2%minNumber == 0) {
      return minNumber
   }

   // returning the GCD
   return gcdOfTwoNumbers(number1, number2, minNumber-1)
}
func main() {

   // declaring the variable to store the value of two numbers
   // and a variable to store an answer
   var number1, number2, gcd, minNumber int

   // initializing both the variables
   number1 = 20
   number2 = 15
   fmt.Println("Program to find the LCM of two numbers using the relation with GCD using recursion.")
   if number1 < number2 {
      minNumber = number1
   } else {
      minNumber = number2
   }

   // calling a function to find the GCD of two number
   // and passing a minimum of number1 and number2
   gcd = gcdOfTwoNumbers(number1, number2, minNumber)
   LCM := (number1 * number2) / gcd

   // printing the result
   fmt.Println("The LCM of", number1, "and", number2, "is", LCM)
}