AutoHotkey Community

LCM(number_1, number_2) ; Least Common Multiple
{
if %number_1% > %number_2% ; This will always make number_2 be greater than number_1
{
   temp_num := number_2
   number_2 := number_1
   number_1 := temp_num
}

if mod(number_1, number_2) = 0 ; If number_2 is divisible by number_1, it will return number_2
   return %number_1%
GCF := GCF(number_1, number_2) ; Finds the GCF

result := round(number_1 * number_2 / GCF) ; Divide out the GCF from one number
return %result%
}

GCF(number_1, number_2) ; Greatest Common Factor
{
if %number_1% > %number_2% ; This will always make number_2 be greater than number_1
{
   temp_num := number_2
   number_2 := number_1
   number_1 := temp_num
}
if mod(number_1, number_2) = 0 ; If number_2 is divisible by number_1, it will return number_1
   return %number_2%
loopcount := floor(number_2 / 2) - 1 ; The greatest factor can only be half of itself, excluding itself
loop %loopcount%         ; Subtracted 1 to make a_index in the loop 1 greater, so starting it at 2
{
divisor := a_index + 1 ; Starts at 2 since 1 is always a factor
if mod(number_1, divisor) = 0
   if mod(number_2, divisor) = 0
      GCM = %divisor% ; Will retrieve the last common factor of number_1 and number_2
}
return %GCM%
}

LCM(4,10)

GCF(4,10)

if %number_1% > %number_2%

if (number_1 > number_2)

if number_1 > %number_2%

GCD(a,b) {      ; Euclidean GCD
   Return b=0 ? Abs(a) : GCD(b, mod(a,b))
}

if %number_1% > %number_2%

if (number_1 > number_2)

if number_1 > %number_2%

Return b=0 ? Abs(a) : GCD(b, mod(a,b))

InputBox Nums, For GCD type two numbers: x`,y,,,400,130
StringSplit a, Nums, `,
MsgBox % "GCD(" a1 "," a2 ")= " GCD(a1,a2)

GCD(a,b) {      ; Euclidean GCD
   Return b=0 ? Abs(a) : GCD(b, mod(a,b))
}