Answered

Westonci.ca is the best place to get answers to your questions, provided by a community of experienced and knowledgeable experts. Explore in-depth answers to your questions from a knowledgeable community of experts across different fields. Discover detailed answers to your questions from a wide network of experts on our comprehensive Q&A platform.

Penn stacks all of his snowballs in a square pyramid. The number of snowballs, P(n), in n layers of the square pyramid is given by P(n) = P(n-1) + n^2 Which could not be the number of snowballs Penn has? 5, 30, 25, 14

Sagot :

LammettHash

Naturally, a pyramid of zero layers doesn't need any snowballs, so P(0) = 0. Then using the given recurrence, we find

P(1) = 1

P(2) = 1 + 4 = 5

P(3) = 1 + 4 + 9 = 14

P(4) = 1 + 4 + 9 + 16 = 30

and so on; luckily, three of these are listed among the answer choices, which leaves 25 as an insufficient number of snowballs to make such a pyramid.

More generally, we would end up with

[tex]P(n) = 1^2 + 2^2 + 3^2 + \cdots + n^2 = \displaystyle \sum_{k=1}^n k^2 = \frac{n(n+1)(2n+1)}6[/tex]

Then given some number of snowballs S, you could try to solve for n such that

S = n (n + 1) (2n + 1)/6

and any S that makes n a non-integer would be the answer.

Thank you for visiting. Our goal is to provide the most accurate answers for all your informational needs. Come back soon. Thanks for using our service. We're always here to provide accurate and up-to-date answers to all your queries. Thank you for trusting Westonci.ca. Don't forget to revisit us for more accurate and insightful answers.