Find the sum of all prime numbers p for which it is impossible to find another prime number that is a multiple of 30 greater than it.

You can use a calculater and divide the minutes by the $$, hope that you

In all honesty, there really is no “work” per say to show. mainly it’s just using the process of elimination. the question is asking which domain(s) would be the most appropriate for the function c(n). n is the number of observed vehicles so right away, 1, 2, and 3 can be eliminated.why? 1, 2 start in the negatives and therefore it is impossible to observe negative cars. so, #4 would be the best answer to the given problem.