Ask your own question, for FREE!
Mathematics 15 Online
OpenStudy (anonymous):

Let H(n) be the number of circles you need to form a hexagon with n circles on each edge. It is clear that H(2) = 7 and H(3) = 19. It can be shown that increasing the number of circles on each edge gives the following recurrence relation: H(n) = {1 if n = 1 H(n) = {H(n − 1) + 6n − 6 if n > 1. Calculate H(9)

OpenStudy (anonymous):

OpenStudy (anonymous):

had to calculate H(4-8) to get the answer wand H(8)=169 H(8)+6*9-6=217

OpenStudy (anonymous):

correct. :)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!