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
What is it about ? And what you need help on
This question can easily be answered if you have an idea about handling spreadsheet applications.
Let's say MS Excel
<span>Column A contains numbers from rows 1 to 20. You can use the formula _______ to find the value of the largest number divided by the total number of value.
In MS Excel, the formula MAX ( ___ ) and COUNT ( ____ ) to get the value
= MAX(A1:A20) / COUNT(A1:A20)</span>
