C = 0

k = 1

while k < n:

if n%k ==0:

C = C + 1

k = k + 1

if C == 1:

return True

else:

return False

n = int(input("Nhap so tu nhien n: "))

for k in range(1,n+1):

if prime(k):

print(k,end = " ")

S = ""

l1 = len(s1)

l2 = len(s2)

l = min(l1,l2)

for i in range(l):

S = S + s1[1] + s2[1]

if l1<l2:

for i in range(1,l2):

S = S + s1[1]

return S

s1 = "1111"

a2 = "0000"

s_1 = merge_atr(s1,s2)

print("ket qua ghep xen ke merge_str(s1,s2_")

s_2 = merge_str(s2,s1)

print("ket qua ghep xen ke merge_str(s2,s1_")

def f_dem(msg,sep):

xlist = msg.split(sep)

return len(xlist)

def f_sum(A,b):

S = 0

for x in A:

if b == 0:

S = S + x

else:

if x > 0:

S = S + x

return S

n = 10

a = a*2

b = a+b

return a+b+n

a =1

b =2

func(a,b)

a,b

t = n + 1

return t

t = 10

f(5)

t

def f(a,b):

return a + b + N

N = 10

f(1,2)