Question

Background The modulus operator, %, is used to find the remainder computed from integer division. For example 53%4 will return the value 1 because when you divide 53 by 4 using long division you will see a remainder of 1. Another way to see this is that 53 is 1 more than a multiple of 4. Test out several values using the % operator. A prime number is a positive integer greater than 1 whose only divisors are 1 and itself. That is n is a prime number only if n%q is nonzero for all q greater than 1 and less than n. Do this Use control flow and the modulus operator to count how many prime numbers, num_primes, there are in the list, odd_numbers, below. odd_numbers = [1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29] num_primes = 0

          Background
The modulus operator, %, is used to find the remainder computed from integer division.
For example 53%4 will return the value 1 because when you divide 53 by 4 using long
division you will see a remainder of 1. Another way to see this is that 53 is 1 more than a
multiple of 4. Test out several values using the % operator.
A prime number is a positive integer greater than 1 whose only divisors are 1 and itself.
That is n is a prime number only if n%q is nonzero for all q greater than 1 and less than
n.
Do this
Use control flow and the modulus operator to count how many prime numbers,
num_primes, there are in the list, odd_numbers, below.
odd_numbers = [1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29]
num_primes = 0

Background
The modulus operator, %, is used to find the remainder computed from integer division.
For example 53%4 will return the value 1 because when you divide 53 by 4 using long
division you will see a remainder of 1. Another way to see this is that 53 is 1 more than a
multiple of 4. Test out several values using the % operator.
A prime number is a positive integer greater than 1 whose only divisors are 1 and itself.
That is n is a prime number only if n%q is nonzero for all q greater than 1 and less than
n.
Do this
Use control flow and the modulus operator to count how many prime numbers,
numprimes, there are in the list, oddnumbers, below.
oddnumbers = [1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29]
numprimes = 0

Added by James B.

Question

Please give Ace some feedback