Determine a recursion relation H(n), including any initial conditions, for the total number of hockey balls in a pile with n layers where the sum of first positive integers is H(n)= n(n+1)/2 the layers are like 1,3,6

asked Nov 30, 2016 in Other Math Topics by marya

Your answer

Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:

To avoid this verification in future, please log in or register.

1 Answer

H(n+1)=(n+1)(n+2)/2.

H(n+1)/H(n)=(n+1)(n+2)/2÷n(n+1)/2=(n+2)/n.

Therefore H(n+1)=(n+2)H(n)/n and H(1)=1.
answered Dec 1, 2016 by Rod Top Rated User (486,780 points)
Welcome to MathHomeworkAnswers.org, where students, teachers and math enthusiasts can ask and answer any math question. Get help and answers to any math problem including algebra, trigonometry, geometry, calculus, trigonometry, fractions, solving expression, simplifying expressions and more. Get answers to math questions. Help is always 100% free!
79,815 questions
83,628 answers
2,041 comments
66,547 users