The recursive formula for a pyramidal sequence is P(n) = P(n-1) + m2. A
stack of cannonballs with 7 layers
has 140 balls. A stack with 8 layers
has 140 + 82 = 204 balls. Find the
number of cannonballs in a stack that
has 10 layers.

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.

Y=-2x-6 is the answer