readme

1_sum.py

@@ -0,0 +1,8 @@
+sum=0
+for i in range(1,501):
+	if (i%5==0)&(i%7!=0):
+		sum=sum+i
+print(sum)
+
+
+

2_area.py

@@ -0,0 +1,5 @@
+x=6
+y=8
+z=10
+area=(x*1.15)*(y*1.15)
+print(area)

4_pythogrean.py

@@ -0,0 +1,6 @@
+import math
+for i in range(1,1000):
+	for j in range(i+1,1000):
+		for k in range(j+1,1000):
+			if (math.pow(k,2)==math.pow(j,2)+math.pow(i,2))&(i+j+k==1000):
+				print(i*j*k)

5_small.py

@@ -0,0 +1,24 @@
+numbers = [];
+count = int(input ("HOW MANY NUMBERS YOU WANT TO CALCULATE GCD?\n"))
+for i in range(0, count):
+  number = int(input("ENTER THE NUMBER : \n"))
+  numbers.append(number)
+numbers_sorted = sorted(numbers)
+print ('NUMBERS SORTED IN INCREASING ORDER\n',numbers_sorted)
+gcd = numbers_sorted[0]
+for i in range(1, count):
+  divisor = gcd
+  dividend = numbers_sorted[i]
+  remainder = dividend % divisor
+  if remainder == 0 :
+    gcd = divisor
+  else :
+    while not remainder == 0 :
+      dividend_one = divisor
+      divisor_one = remainder
+      remainder = dividend_one % divisor_one
+      gcd = divisor_one
+product=1
+for j in range(0,len(numbers)):
+  product=product*numbers[j]
+print(product/gcd)  

6_primes.py

@@ -0,0 +1,11 @@
+def prime(n):
+	for i in range(2,n):
+		if(n%i==0):
+			return -1
+	return 1
+n=int(input("enter number of primes less than a number"))
+x=0
+for i in range(1,n):
+	x=prime(i)
+	if(x==1):
+		print(i)

7_palindrome.py

@@ -0,0 +1,6 @@
+x=input("enter a string")
+x_rev=str(x[::-1])
+if x==x_rev:
+	print("palindrome")
+else:
+	print("not a palindrome")