diff --git a/Java/Extended_eucledian.java b/Java/Extended_eucledian.java
new file mode 100644
index 00000000..29ca0fd3
--- /dev/null
+++ b/Java/Extended_eucledian.java
@@ -0,0 +1,36 @@
+// Java program to demonstrate working of extended
+// Euclidean Algorithm
+
+import java.util.*;
+import java.lang.*;
+
+class GCD {
+	// extended Euclidean Algorithm
+	public static int gcdExtended(int a, int b, int x, int y)
+	{
+		// Base Case
+		if (a == 0) {
+			x = 0;
+			y = 1;
+			return b;
+		}
+
+		int x1 = 1, y1 = 1; // To store results of recursive call
+		int gcd = gcdExtended(b % a, a, x1, y1);
+
+		// Update x and y using results of recursive
+		// call
+		x = y1 - (b / a) * x1;
+		y = x1;
+
+		return gcd;
+	}
+
+	public static void main(String[] args)
+	{
+		int x = 1, y = 1;
+		int a = 35, b = 15;
+		int g = gcdExtended(a, b, x, y);
+		System.out.print("gcd(" + a + ", " + b + ") = " + g);
+	}
+}