In [15]:
def number(n):
for i in range(1,n+1):
print(' '*(n-i)+(char(m)+' ')*i)
def char(m):
return m
n=int(input('Enter the line:'))
m=input('Enter your char:')
number(n)
In [51]:
for i in range(1,10):
for j in range(1,i+1):
print(i,'*',j,'=',i*j,'\t',end='')
print(' ')
In [2]:
def prime(num):
n=1
numbers=[]
for i in range(2,100001):
while (n<i):
if i%n == 0:
n+=1
break
else:
n+=1
numbers.append(numbers)
for j in range(i+1):
for k in range(i+1):
if num == numbers[j]+numbers[k]:
print(numbers[j],numbers[k])
else:
continue
num=int(input('Give a number:'))
prime(num)
In [3]:
numbers=[]
while(0<n and n<21):
for i in range(21):
numbers.append()
if i==n:
In [ ]: