From 22e81b66f9f0e9186ade08e0565b5534ab276bb3 Mon Sep 17 00:00:00 2001
From: AKBARVE04 <118174073+AKBARVE04@users.noreply.github.com>
Date: Tue, 10 Oct 2023 19:47:43 +0530
Subject: [PATCH] Add files via upload

Uploaded some basic python programs.
---
 Greatest Comman Divisor.py | 17 +++++++++++++++++
 Prime_Not_prime.py         | 11 +++++++++++
 recursion - factorial.py   | 18 ++++++++++++++++++
 reversing_number.py        |  7 +++++++
 4 files changed, 53 insertions(+)
 create mode 100644 Greatest Comman Divisor.py
 create mode 100644 Prime_Not_prime.py
 create mode 100644 recursion - factorial.py
 create mode 100644 reversing_number.py

diff --git a/Greatest Comman Divisor.py b/Greatest Comman Divisor.py
new file mode 100644
index 00000000..4e53aec0
--- /dev/null
+++ b/Greatest Comman Divisor.py	
@@ -0,0 +1,17 @@
+a = int(input("Enter the 1st number:\t"))
+b = int(input("Enter the 1st number:\t"))
+l1 = []
+l2 = []
+l = []
+for i in range(1,a+1):
+    if a%i==0:
+        l1.append(i)
+for j in range(1,b+1):
+    if b%j==0:
+        l2.append(j)
+for i in range(0,len(l1)):
+    for j in range(0,len(l2)):
+        if l1[i]==l2[j]:
+            l.append(l1[i])
+l.sort()
+print(l[-1])
\ No newline at end of file
diff --git a/Prime_Not_prime.py b/Prime_Not_prime.py
new file mode 100644
index 00000000..22140c02
--- /dev/null
+++ b/Prime_Not_prime.py
@@ -0,0 +1,11 @@
+print("PROGRAM FOR CHECKING IF A NUMBER IS A PRIME NUMBER OR NOT")
+n = int(input("Enter the number:\t"))
+if n>1:
+    for i in range(2,int(n/2)+1):
+        if n%i==0:
+            print(n,"is not a prime number.")
+            break
+    else:
+        print(n,"is a prime number.")
+else:
+    print(n,"is not a prime number.")
diff --git a/recursion - factorial.py b/recursion - factorial.py
new file mode 100644
index 00000000..f852d435
--- /dev/null
+++ b/recursion - factorial.py	
@@ -0,0 +1,18 @@
+n = int(input("Enter the number:\t"))
+def fact(n):
+    if n==0:
+        return (1)
+    else:
+        return (n*fact(n-1))
+print("Factorial of",n,"=",fact(n))
+
+
+'''fact(4):
+	4*fact(3):
+		3*fact(2):
+			2*fact(1):
+				1*fact(0):
+					return 1'''     # TO GET THE OUTPUT WITH BACKTRACKING
+
+
+# DATA STRUCTURE USED IN RECCURSION IS CALLED STACK AND IT FOLLOWS LIFO TECHNOLOGY i.e LAST IN FIRST OUT
diff --git a/reversing_number.py b/reversing_number.py
new file mode 100644
index 00000000..5287d001
--- /dev/null
+++ b/reversing_number.py
@@ -0,0 +1,7 @@
+n = int(input("Enter the number:\t"))
+r = 0
+while n>0:
+    remi = n%10
+    r = r*10 + n%10
+    n = n//10
+print(r)