LotusChing

def pascal_triangle(m):
    n, b = 0, [1]
    print(b)
    while n < m:
        b = [1] + [b[i] + b[i + 1] for i in range(len(b) - 1)] + [1]
        print(b)
        n += 1
pascal_triangle(10)

LotusChing

lst = [2, 3, 4, 5, 6, 7]
sum = 0
def Prime(n):
    for i in range(2, n):
        if n % i == 0:
            return False
    else:
        return True

for i in lst: