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

in Other Math Topics by

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.
by Top Rated User (1.2m points)

Related questions

1 answer
1 answer
asked Nov 1, 2020 in Other Math Topics by McCquabena Bannor Level 4 User (7.5k points) | 2.1k views
1 answer
asked Nov 18, 2016 in Other Math Topics by anonymous | 985 views
1 answer
asked Nov 18, 2016 in Other Math Topics by anonymous | 693 views
1 answer
asked Jun 14, 2016 in Other Math Topics by Asdfghjk | 805 views
1 answer
asked Jan 31, 2016 in Other Math Topics by Masselina Damalie | 685 views
1 answer
asked Dec 7, 2015 in Other Math Topics by codeguru Level 1 User (260 points) | 1.4k views
1 answer
asked Dec 11, 2015 in Other Math Topics by codeguru Level 1 User (260 points) | 1.9k views
2 answers
1 answer
asked Aug 20, 2014 in Other Math Topics by sheetalstar Level 1 User (120 points) | 885 views
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!
87,516 questions
100,289 answers
2,420 comments
739,788 users