python-243_2/class16.py at main · asm-nasim-khan/python-243_2 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
# num = 24
# count = 0
# for i in range(1,num+1):
#     if num%i == 0:
#         count = count + 1

# if count==2:
#     print(num,"is a Prime Number.")
# else:
#     print(num,"is not a prime Number.")


# def isPrime(num):
#     pass

# isPrime(11)

# def isprime(num):
#     count= 0
#     for i in range(1,num):
#         if num%i==0:
#             count = count + 1
#     if count==2:
#         print(num,"is a prime number")
#     else:
#         print(num,"is not a prime number")

# isprime(11)

# def def_prime_no(num):
#     count = 0
#     for i in range(1, num+1):
#         if num%i == 0:
#             count += 1
#     return count

# num = 53,
# k = 0
# for j in range(0, num+1):
#     k = k +j
# print(f"The sum: {k}")


# num = 28
# total = 0
# for i in range(1,num):
#     if num%i == 0:
#         total = total + i

# if total==num:
#     print(num,"is a Perfect Number.")
# else:
#     print(num,"is not a Perfect Number.")

# lst = [1,-3,5,5]
# print(min(lst))
# print(max(lst))

# min_num = lst[0]
# for i in range(len(lst)):
#     if lst[i] < min_num:
#         min_num = lst[i]
# print(min_num)

# def isPerfect(num):
#     total = 0
#     for i in range(1,num):
#         if num%i == 0:
#             total = total + i

#     if total==num:
#         print(num,"is a Perfect Number.")
#     else:
#         print(num,"is not a Perfect Number.")
# isPerfect(28)

def myFun(num):
    if num == 0:
        return
    myFun(num-1)
    print(num)

myFun(5)


# lst = [8,2,1,5]
# m = lst[0]
# for x in lst:
#     if x>m:
#         m = x
# print("The largest value is", m)


# list=[55,66,88,100,700]

# largestnumber=list[0]
# for i in range (len(list)):
#     if list[i]>largestnumber:
#         largestnumber=list[i]
# print(largestnumber)

# def max_num(mylst):
#     max_num=mylst[0]
#     for i in range(len(mylst)):
#         if mylst[i]> max_num:
#             max_num=mylst[i]
#     return max_num

# y=[100,2000,3,0,800,400,-5,6,-900]
# result=max_num(y)
# print(result)


# def myFun(num):
#     if num == 0:
#         return
#     print(num)
#     myFun(num-1)
#     print("good")

# myFun(5)