Phase

Author: achilleslinux

armstrong_number.py

@@ -0,0 +1,13 @@
+usrinput=input("Enter a number")
+k = []
+for i,c in enumerate(usrinput):
+    m = int(c)
+    a = m**3
+    k.append(a)
+
+
+add=sum(i for i in k)
+if add == int(usrinput):
+    print("The number is an armstrong number")
+else:
+    print("The number is not an armstrong number")

fibonacci_with_loop.py

@@ -0,0 +1,16 @@
+#Fibonacci Series with for loop
+
+num = int(input("enter number of digits you want in series (minimum 2): "))
+ 
+first = 0
+second = 1
+ 
+print("\nfibonacci series is:")
+print(first, ",", second, end=", ")
+ 
+for i in range(2, num):
+	next = first + second
+	print(next, end=", ")
+ 
+	first = second
+	second = next

fibonacci_with_recursion.py

@@ -0,0 +1,14 @@
+def recur_fibo(n):
+   if n <= 1:
+       return n
+   else:
+       return(recur_fibo(n-1) + recur_fibo(n-2))
+# take input from the user
+nterms = int(input("How many terms? "))
+# check if the number of terms is valid
+if nterms <= 0:
+   print("Plese enter a positive integer")
+else:
+   print("Fibonacci sequence:")
+   for i in range(nterms):
+       print(recur_fibo(i))