diff --git a/chineseremaindertheorem.cpp b/chineseremaindertheorem.cpp
new file mode 100644
index 0000000..bfcd5c6
--- /dev/null
+++ b/chineseremaindertheorem.cpp
@@ -0,0 +1,30 @@
+#include<bits/stdc++.h> 
+using namespace std; 
+
+int findMinX(int num[], int rem[], int k) 
+{ 
+	int x = 1; 
+	while (true) 
+	{  
+		int j; 
+		for (j=0; j<k; j++ ) 
+			if (x%num[j] != rem[j]) 
+			break; 
+
+		if (j == k) 
+			return x; 
+		x++; 
+	} 
+
+	return x; 
+} 
+
+
+int main(void) 
+{ 
+	int num[] = {3, 4, 5}; 
+	int rem[] = {2, 3, 1}; 
+	int k = sizeof(num)/sizeof(num[0]); 
+	cout << "x :  " << findMinX(num, rem, k); 
+	return 0; 
+}