Merge pull request 'Add LCM script (Task 2) - final' (#7) from feature/lcm-script-final into master

Reviewed-on: #7

script_GCD.sh

@@ -1,6 +1,6 @@
 #!/bin/bash
 
-
+# Function to find GCD using Euclidean algorithm
 gcd() {
     local a=$1
     local b=$2
@@ -14,12 +14,12 @@ gcd() {
     echo $a
 }
 
-
+# Check arguments
 if [ $# -ne 2 ]; then
     echo "Usage: $0 <number1> <number2>"
     exit 1
 fi
 
-
+# Call function and print result
 result=$(gcd $1 $2)
 echo "НОД($1, $2) = $result"

script_LCM.sh

@@ -0,0 +1,35 @@
+#!/bin/bash
+
+# Function to find GCD (Greatest Common Divisor)
+gcd() {
+    local a=$1
+    local b=$2
+    
+    while [ $b -ne 0 ]; do
+        local temp=$b
+        b=$((a % b))
+        a=$temp
+    done
+    
+    echo $a
+}
+
+# Function to find LCM (Least Common Multiple)
+lcm() {
+    local a=$1
+    local b=$2
+    
+    # LCM = (a * b) / GCD(a, b)
+    local gcd_value=$(gcd $a $b)
+    echo $(( (a * b) / gcd_value ))
+}
+
+# Check arguments
+if [ $# -ne 2 ]; then
+    echo "Usage: $0 <number1> <number2>"
+    exit 1
+fi
+
+# Call function and print result
+result=$(lcm $1 $2)
+echo "НОК($1, $2) = $result"