Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- vetor = [2,3,4,5,11,15,20]
- divisions_list = []
- def isprime():
- divisions = 0
- i = 0
- for i in range(1, vetor[i+1]):
- if i % i == 0:
- divisions = divisions + 1
- divisions_list.append(divisions)
- if divisions == 2:
- print('The number {} is prime'.format(vetor[i]))
- else:
- print('The number {} is not prime'.format(vetor[i]))
- print(isprime())
- from math import sqrt
- def is_prime(n):
- divisions = 0
- for i in range(2, int(sqrt(n))):
- if num % i == 0:
- return False
- return True
- vector= [2,3,4,5,11,15,20]
- for n in vector:
- if is_prime(n):
- print('prime')
- else:
- print('not a prime')
- vetor = [2,3,4,5,11,15,20]
- divisions_list = []
- def isprime():
- for num in vetor:
- divisions = 0
- for i in range(1, num+1):
- if num % i == 0:
- divisions = divisions + 1
- divisions_list.append(divisions)
- if divisions == 2:
- print('The number {} is prime'.format(num))
- else:
- print('The number {} is not prime'.format(num))
- isprime()
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement