basic programs python

purohitdheeraj · purohitdheeraj · commit f52d657da897 · 2021-02-18T23:59:25.000+05:30
diff --git a/armstrong.py b/armstrong.py
@@ -0,0 +1,18 @@
+def i_am_strong(num):
+    # a positive integer is called an arm strong number if abc  = a**3 + b**3 + c**3 
+    # 153 = 1 ** 3 + 5 ** 3 + 3 ** 3
+    # order of number
+    # access each digit and put ** to it
+    # sum all the exponented number
+    # check if they are equal to num
+    order = len(str(num))
+    sum =0
+    temp  = num
+    while temp > 0:
+        digit = temp % 10 # We can get our last digit by % 10...153 % 10 == 3 
+        sum += digit ** order # so we got 3 from digit operation and now will apply exponent of order of num
+        temp //= 10 # this will reduce our number to 0 and will exit the loop after temp < 0:
+    if sum == num:
+        return True
+
+print(i_am_strong(153))
diff --git a/factorial.py b/factorial.py
@@ -0,0 +1,13 @@
+def fact_o_real(num):
+    result = 1
+    while num > 1:
+        print(result)
+        result *= num
+         
+        num = num -1
+    return result
+
+print(fact_o_real(5))
+
+# factorial of 0 is 1
+# factorial does not exist for negative number
diff --git a/fibonacci.py b/fibonacci.py
@@ -0,0 +1,15 @@
+def fibonacci(num):
+    # 0 1 1 2 3 5 8 13 fibonacci series
+    # if num == 0 or num < 1:
+    #     print(num)
+    a = 0 
+    b = 1
+    print(a)
+    print(b)
+    while a + b <= num:
+        c = a + b
+        print(c)
+        a = b
+        b = c
+        
+fibonacci(100) 
diff --git a/largest_among_three.py b/largest_among_three.py
@@ -0,0 +1,10 @@
+def largest_num(nums):
+    largest = nums[0]
+    for i in range(len(nums)):
+        if nums[i] > largest:
+            largest = nums[i]
+    return largest
+
+large = largest_num([4,3,5,2,6,1,7])
+
+print(large)
diff --git a/leapyear.py b/leapyear.py
@@ -0,0 +1,14 @@
+def leap(num):
+
+    if num % 4 == 0: # Then its an LEAP Year
+        if num % 100 == 0: # if its an century then its not Leap Year
+            if num % 400 == 0: # if that century is 4th century then its leap year
+                print('Leap Year')
+            else:
+                print("Ordinary Year")
+        else:
+            print("Leap Year")
+    else:
+        print("Ordinary Year")
+
+leap(2020)
diff --git a/multipliacation_table.py b/multipliacation_table.py
@@ -0,0 +1,5 @@
+def multiplication_table(num):
+    for i in range(1,13):
+        print(str(num) +" x " + str(i) +" = "+ str(num * i))
+
+multiplication_table(2)
diff --git a/prime.py b/prime.py
@@ -0,0 +1,15 @@
+def prime(num):
+	if num > 1:
+		for i in range(2, num):
+			if num % i == 0:
+				print(str(num)+" is not Prime number")
+				print(str(i)+" times "+str(num//i)+" is "+str(num))
+				break
+		else:
+			print(str(num)+" is Prime number")
+			
+	else:
+		print("number is less than 1 it cannot be prime.")
+
+
+prime(6)
diff --git a/prime_interval.py b/prime_interval.py
@@ -0,0 +1,12 @@
+def prime_interval(lower, upper):
+    for num in range(lower, upper+1):
+        if num > 1:
+            for i in range(2, num):
+                if num % i == 0:
+                    # print(str(i)+" times "+str(num//i)+" is"+ str(num))
+                    # print("Not Prime")
+                    break
+            else: # we have written this else block outside of for loop to ensure the prime no is not repeated till num value..
+                print(num)
+
+prime_interval(3, 11)
diff --git a/sum_natural_numbers.py b/sum_natural_numbers.py
@@ -0,0 +1,12 @@
+def sum_natural(num):
+    sum = 0
+    while num > 0:
+        sum += num
+        num -= 1
+    return sum
+
+def sum_natural_formula(num):
+    return num*(num+1)/2
+
+print(sum_natural(5))
+print(sum_natural_formula(5))
