diff --git a/1_sum b/1_sum
new file mode 100644
index 0000000..0b1e3b9
--- /dev/null
+++ b/1_sum
@@ -0,0 +1,6 @@
+sum=0;
+for i in range(1,501):
+	if((i%5==0)and(i%7!=0)):
+		sum+=i;
+
+print (sum);
diff --git a/2_area b/2_area
new file mode 100644
index 0000000..c73109a
--- /dev/null
+++ b/2_area
@@ -0,0 +1,3 @@
+l=6;b=8;h=10;
+a=(6*1.15*8*1.15*10*1.15);
+print (round(a,2));
diff --git a/3_alpha b/3_alpha
new file mode 100644
index 0000000..7e09a86
--- /dev/null
+++ b/3_alpha
@@ -0,0 +1,4 @@
+set1=["Ron","Hermione","Harry","Professor","Dobby"];
+set2=["The House Elf","Potter","Granger","Lockhart","Weasley"];
+set1.sort();
+print (set2+set1);
diff --git a/4_triplet b/4_triplet
new file mode 100644
index 0000000..7bbcb86
--- /dev/null
+++ b/4_triplet
@@ -0,0 +1,6 @@
+for a in range(1, 1000):  
+     for b in range(a, 1000):  
+         c = 1000 - a - b  #as 
+         if c*c == a*a + b*b:  
+                 print (a*b*c)  
+                 break  
diff --git a/5_lcm b/5_lcm
new file mode 100644
index 0000000..b56cdcc
--- /dev/null
+++ b/5_lcm
@@ -0,0 +1,15 @@
+def gcd(a, b):
+    
+    while b:      
+        a, b = b, a % b
+    return a
+
+def lcm(a, b):
+    
+    return a * b // gcd(a, b)
+
+x=1;
+
+for num in range(1,21):
+    	x=lcm(x,num);
+print(x);	
diff --git a/6_prime b/6_prime
new file mode 100644
index 0000000..86fbdd8
--- /dev/null
+++ b/6_prime
@@ -0,0 +1,8 @@
+for number in range(1,100000+1):
+   
+   
+       for i in range(2,number):
+           if (number % i) == 0:
+               break
+       else:
+           print(number)
diff --git a/7_palindrome b/7_palindrome
new file mode 100644
index 0000000..c2d6463
--- /dev/null
+++ b/7_palindrome
@@ -0,0 +1,6 @@
+string1=input('enter the string\n'); #asking user for input 
+string2=string1[::-1]; #reversing the string
+if(string1==string2):  #checking if they're equal
+	print('entered string is palindrome'); 
+else:
+	print('entered string is not a palindrome');