=========================================================================

Reconsider the Prime Numbers class from the previous exercise. Normally, this problem is solved with the Sieve of Eratosthenes [Wikipedia, 2015). The change in algorithm changes the consequences of the fault. Specifically, false positives are now possible in addition to false negatives. Recode the algorithm to use the Sieve approach, but leave the fault. What is the first false positive, and how many "primes must a test case generate before encountering it? What does this exercise show about the RIPR model