What can we do to show that 313 is prime? OWe can determine whether the smallest prime number greater than /313 (19 in this case) is a factor of 313. If 19 does not divide 313, then 313 is a prime number. O We can determine whether any number smaller than 313 and greater than 1 divides 313. If there is such a number, then 313 is not prime. We can divide 313 by all uneven numbers smaller than 313 and greater than 2. If 313 is not divisible by any of these numbers, then 313 is prime. We can determine whether any prime smaller than V313 is a factor of 313. If none of (2, 3, 5, 7, 11, 13, 17} divides 313, then 313 is prime.