Ask
your own question, for FREE!
Mathematics
4 Online
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)
Still Need Help?
Join the QuestionCove community and study together with friends!
had to calculate H(4-8) to get the answer wand H(8)=169 H(8)+6*9-6=217
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!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
DoltonCarlee:
what are y'all's options on S A T essays because honestly their not that bad
thereneelg:
Can someone give me a summary of article 231, The war guilt clause?? I need to explain what it is, but I can't find any shortened version of what it is and
luisaam2:
What should you do when the person you want to talk to the most is the one making
Breathless:
https://medal.tv/games/roblox/clips/nAYivIl6oXB6q9QAI?invite=cr-MSxCSk4sMTY4OTA4N
Twaylor:
I'm not that good at law can someone fact check this without bias? June 29, 2026, the Supreme Court decided Chatrie v.
Demon25:
For a hoco proposal with a cheerleader and football player, what else should be a
9 hours ago
4 Replies
2 Medals
1 day ago
7 Replies
1 Medal
14 hours ago
16 Replies
1 Medal
1 week ago
0 Replies
0 Medals
1 week ago
0 Replies
0 Medals
1 week ago
12 Replies
0 Medals