Question

What can we do to show that 101 is prime? We can determine whether the greatest prime smaller than ?101 (7 in this case) is a factor of 101. If 7 divides 101, then 101 is not a prime number. We can divide 101 by all uneven numbers smaller than 101 and greater than 2. If 101 is not divisible by any of these numbers, then 101 is prime. We can determine whether any number smaller than 101 and greater than 1 divides 101. If there is such a number then 101 is not prime. We can determine whether any prime smaller than ?101 is a factor of 101. If none of {2, 3, 5, 7} divides 101, then 101 is prime.

          What can we do to show that 101 is prime?

We can determine whether the greatest prime smaller than 
?101
(7 in this case) is a factor of 101. If 7 divides 101, then 101 is not a prime number.

We can divide 101 by all uneven numbers smaller than 101 and greater than 2. If 101 is not divisible by any of these numbers, then 101 is prime.

We can determine whether any number smaller than 101 and greater than 1 divides 101. If there is such a number then 101 is not prime.

We can determine whether any prime smaller than
?101
is a factor of 101. If none of {2, 3, 5, 7} divides 101, then 101 is prime.

What can we do to show that 101 is prime?

We can determine whether the greatest prime smaller than
?101
(7 in this case) is a factor of 101. If 7 divides 101, then 101 is not a prime number.

We can divide 101 by all uneven numbers smaller than 101 and greater than 2. If 101 is not divisible by any of these numbers, then 101 is prime.

We can determine whether any number smaller than 101 and greater than 1 divides 101. If there is such a number then 101 is not prime.

We can determine whether any prime smaller than
?101
is a factor of 101. If none of 2, 3, 5, 7 divides 101, then 101 is prime.

Added by Todd F.

Question

Please give Ace some feedback