Answer:
def prime_generator(s, e):
for number in range(s, e+1):
if number > 1:
for i in range(2, number):
if (number % i) == 0:
break
else:
print(number)
prime_generator(6,17)
Explanation:
I believe you want to ask the prime numbers between s and e.
- Initialize a for loop that iterates from s to e
- Check if the number is greater than 1. If it is, go inside another for loop that iterates from 2 to that number. If the module of that number to any number in range (from 2 to that number) is equal to 0, this means the number is not a prime number. If the module is not equal to zero, then it is a prime number. Print the number
It can have only 16,384 number of columns
Answer:
import random
def simulate_observations():
#this generates an array of 7 numbers
#between 0 and 99 and returns the array
observations = random.sample(range(0, 100), 7)
return observations
#here,we call the function created above and print it
test_array = simulate_observations()
print(str(test_array))
At the top of their name when they answer it should say “give brainliest”