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
Answer:
C
Explanation:
best option for the available answers
Answer:
The answer is "
Co-operative federalism".
Explanation:
It is also known as Marble-cake governance, this federalism provides an idea, in which both governments (state and local), works together and productively resolves the common issues, that are distinct, but mostly identical.
- It provides disagreement, over a policy in a national system, that is governed by the federal state.
- It supports fitness, that's why the Co-operative federalism is the correct answer.
