Python 2
Python 2
x = 3.6
ARMSTRONG FIBONACII # floor(): Returns the largest integer less than or equal to x
def string_slicing(text):
print("floor({}) = {}".format(x, math.floor(x))) print("Original string:", text)
def is_armstrong_number(num): def fibonacci(n):
fib_series = [] print("First three characters:", text[:3])
num_str = str(num) import math
x = 3.6 print("Characters from index 3 to 7:", text[3:8])
if n <= 0:
num_digits = len(num_str) result = math.ceil(x)
return fib_series print("ceil({}) = {}".format(x, result)) print("Last five characters:", text[-5:])
sum_of_cubes = 0 elif n == 1: print("Every second character:", text[::2])
fib_series.append(0) print("Reversed string:", text[::-1])
for digit in num_str: else:
import math
x = 3.6 result = math.trunc(x) def main():
sum_of_cubes += int(digit) ** num_digits fib_series = [0, 1] print("trunc({}) = {}".format(x, result)) text = "Python Programming"
return sum_of_cubes == num for i in range(2, n): string_slicing(text)
fib_series.append(fib_series[-1] + fib_series[-2])
def main(): return fib_series
if __name__ == "__main__":
main()
num = int(input("Enter a number: ")) def main(): x = 100
import math
my_list = [1, 2, 3, 2, 2, 4]
print(my_list.count(2))