Math Exploration

[bobsmegdorf]

Hi!

I'm working on my Math Exploration. I've done about half of it so far- I found an equation for the Tower of Hanoi solution and then proved it. However, I need to "explore further" on recurrence relations. I'm kind of stuck right now; I don't know what I can investigate in recurrence relations. Could you give me suggestions on what to do?

Thanks!

[Yannis Gartaganis]

search that! additionally don't search google but google scholar which as scientific articles. moreover, try to examine the minimum number of moves in order to solve the tower of Hanoi.

ex.

for 3 "stones" it needs... minimum moves,

for 4 .....

for 5...

for 6...

and you can explore that for up to 10 or 15

I hope this helps!