#HW4

#bai2

import numpy as np

def my_checker_board(n):

m=np.zeros((n,n))

m[::2,::2]=1

m[1::2,1::2]=1

return m

print(my_checker_board(5))

#bai14

def bounding_array(A, top, bottom):

output=[]

for i in A:

if i <= bottom:

output.append(bottom)

elif i>= top:

output.append(top)

else:

output.append(i)

return output

print(bounding_array(np.arange(-5,6,1),3,-3))
#bai1

def snt(n):

if (n<2):

return 0

for i in range(2,n):

if (n%i==0):

return 0

return 1

print(snt(3))

#bai2

def snt_n(n):

for i in range(0,n+1):

if snt(i)== 1:

print(i,'')

n= int(input('nhap n:'))

print('các số nguyên tố từ 0 đến',n,'là:')

print(snt_n(n))
#bai3

a= int(input('nhap a:'))

def n_snt(n):

dem = 0

i=2

while(dem<n):

if snt(i)==1:

dem=dem+1

print(i,'')

i=i+1

print(n_snt(a))