diff --git a/file2.py b/file2.py
new file mode 100644
index 0000000..e69de29
diff --git a/gitworkshop-batch2 b/gitworkshop-batch2
new file mode 160000
index 0000000..5f2070f
--- /dev/null
+++ b/gitworkshop-batch2
@@ -0,0 +1 @@
+Subproject commit 5f2070fe49a3545e4fcfb8b86acc99f00a08733c
diff --git a/gitworkshop.py b/gitworkshop.py
new file mode 100644
index 0000000..2f35d0b
--- /dev/null
+++ b/gitworkshop.py
@@ -0,0 +1,5 @@
+def prime():
+    for num in range(1, 101):
+        if all(num % i != 0 for i in range(2, num)):
+            print(num)
+prime()
\ No newline at end of file
diff --git a/manoj1.py b/manoj1.py
new file mode 100644
index 0000000..fd5269e
--- /dev/null
+++ b/manoj1.py
@@ -0,0 +1,11 @@
+def prime(num):
+    if num < 2:
+        return False
+    for i in range(2, int(num**0.5) + 1):
+        if num % i == 0:
+            return False
+    return True
+
+for number in range(1, 101):
+    if prime(number):
+        print(number, end=' ')
diff --git a/poojith.py b/poojith.py
new file mode 100644
index 0000000..d84210f
--- /dev/null
+++ b/poojith.py
@@ -0,0 +1,10 @@
+def isprime(n):
+	for i in range(2,n//2):
+		if n%i==0:
+			return False
+	return True
+
+
+for i in range(1,101):
+	if isprime(i):
+		print(i)
\ No newline at end of file
diff --git a/prime1.py b/prime1.py
new file mode 100644
index 0000000..2ce778a
--- /dev/null
+++ b/prime1.py
@@ -0,0 +1,10 @@
+n=int(input("enter a number "))
+def priime(n):
+    for i in range(2,101):
+        for j in range(2,101):
+            if i%j==0:
+                print(i)
+            else:
+                print("not prime")
+    
+priime(n)
\ No newline at end of file
diff --git a/raju.py b/raju.py
new file mode 100644
index 0000000..69b3a32
--- /dev/null
+++ b/raju.py
@@ -0,0 +1,6 @@
+for i in range(2,101):
+    for j in range(2,101):
+        if i%j == 0:
+            break
+    if i==j:
+        print(i)
diff --git a/sai.py b/sai.py
new file mode 100644
index 0000000..efa8609
--- /dev/null
+++ b/sai.py
@@ -0,0 +1,19 @@
+def prime(x, y):
+    prime_list = []
+    for i in range(x, y):
+        if i == 0 or i == 1:
+            continue
+        else:
+            for j in range(2, int(i/2)+1):
+                if i % j == 0:
+                    break
+            else:
+                prime_list.append(i)
+    return prime_list
+starting_range = 2
+ending_range = 7
+lst = prime(starting_range, ending_range)
+if len(lst) == 0:
+    print("There are no prime numbers in this range")
+else:
+    print("The prime numbers in this range are: ", lst)
diff --git a/sathvik.py b/sathvik.py
new file mode 100644
index 0000000..e69de29
diff --git a/siddu.cpp b/siddu.cpp
new file mode 100644
index 0000000..ff20f18
--- /dev/null
+++ b/siddu.cpp
@@ -0,0 +1,23 @@
+#include<bits/stdc++.h>
+using namespace std;
+int prime(int n)
+{
+if(n<0)
+return 0;
+for(int i=2;i<n;i++)
+{
+if(n%i==0)
+return 0;
+}
+return 1;
+}
+int main()
+{
+for(int i=1;i<=100;i++)
+{
+if(prime(i))
+cout<<i<<" " ;
+}
+
+
+}
\ No newline at end of file
diff --git a/siddu.py b/siddu.py
new file mode 100644
index 0000000..e69de29
diff --git a/ve.py b/ve.py
new file mode 100644
index 0000000..5034d05
--- /dev/null
+++ b/ve.py
@@ -0,0 +1,14 @@
+def is_prime(num):
+    if num < 2:
+        return False
+    for i in range(2, int(num**0.5) + 1):
+        if num % i == 0:
+            return False
+    return True
+prime_numbers = []
+for num in range(1, 101):
+    if is_prime(num):
+        prime_numbers.append(num)
+print("Prime numbers between 1 and 100:")
+print(prime_numbers)
+