Merge pull request ephremdeme#112 from dev-abir/master

add gcd and lcm in java, c++, c and golang

Author: ephremdeme

Mathematics/GCD/LcmGcd.java

@@ -0,0 +1,23 @@
+public class LcmGcd {
+
+// recursive function to return gcd of a and b 
+private static int gcd(int a, int b) {
+/*please see: https://en.wikipedia.org/wiki/Euclidean_algorithm*/
+if (b == 0) return a;
+return gcd(b, a % b);
+}
+
+// function to return LCM of two numbers 
+private static int lcm(int a, int b) {
+/*
+a * b = lcm(a, b) * gcd (a, b)
+lcm(a, b) = (a * b) / gcd(a, b)
+*/
+return (a / gcd(a, b)) * b;
+}
+
+public static void main(String[] args) {
+System.out.println("lcm of 10, 35 is: " + lcm(10, 35));
+System.out.println("gcd of 10, 35 is: " + gcd(10, 35));
+}
+}

Mathematics/GCD/lcm_gcd.c

@@ -0,0 +1,23 @@
+#include <stdio.h> 
+
+// recursive function to return gcd of a and b 
+int gcd(int a, int b) {
+/*please see: https://en.wikipedia.org/wiki/Euclidean_algorithm*/
+if (b == 0) return a;
+return gcd(b, a % b);
+}
+
+// function to return LCM of two numbers 
+int lcm(int a, int b) {
+/*
+a * b = lcm(a, b) * gcd (a, b)
+lcm(a, b) = (a * b) / gcd(a, b)
+*/
+return (a / gcd(a, b)) * b;
+}
+
+int main() {
+printf("lcm of 10, 35 is: %d\n", lcm(10, 35));
+printf("lcm of 10, 35 is: %d\n", gcd(10, 35));
+ return 0;
+}

Mathematics/GCD/lcm_gcd.cpp

@@ -0,0 +1,25 @@
+#include <iostream> 
+
+using namespace std;
+
+// recursive function to return gcd of a and b 
+int gcd(int a, int b) {
+/*please see: https://en.wikipedia.org/wiki/Euclidean_algorithm*/
+if (b == 0) return a;
+return gcd(b, a % b);
+}
+
+// function to return LCM of two numbers 
+int lcm(int a, int b) {
+/*
+a * b = lcm(a, b) * gcd (a, b)
+lcm(a, b) = (a * b) / gcd(a, b)
+*/
+return (a / gcd(a, b)) * b;
+}
+
+int main() {
+cout << "lcm of 10, 35 is: " << lcm(10, 35) << "\n";
+cout << "gcd of 10, 35 is: " << gcd(10, 35) << "\n";
+ return 0;
+}

Mathematics/GCD/lcm_gcd.go

@@ -0,0 +1,27 @@
+package main
+
+import "fmt"
+
+// recursive function to return gcd of a and b
+func gcd(a int, b int) int {
+/*please see: https://en.wikipedia.org/wiki/Euclidean_algorithm*/
+if b == 0 {
+return a
+}
+return gcd(b, a%b)
+}
+
+// function to return LCM of two numbers
+func lcm(a int, b int) int {
+/*
+a * b = lcm(a, b) * gcd (a, b)
+lcm(a, b) = (a * b) / gcd(a, b)
+*/
+return (a / gcd(a, b)) * b
+}
+
+func main() {
+fmt.Println("lcm of 10, 35 is: ", lcm(10, 35))
+fmt.Println("lcm of 10, 35 is: ", gcd(10, 35))
+}
+