A community for students. Sign up today!
Here's the question you clicked on:
 0 viewing
 2 years ago
In the Tower of Hanoi problem, suppose you have three pegs and n disks. How many different arrangements are there of the n disks on three pegs so that no disk is on top of a smaller disk?
 2 years ago
In the Tower of Hanoi problem, suppose you have three pegs and n disks. How many different arrangements are there of the n disks on three pegs so that no disk is on top of a smaller disk?

This Question is Closed

KingGeorge
 2 years ago
Best ResponseYou've already chosen the best response.2Someone correct me if I'm doing this completely wrong. I believe the trick is to start with the bottom disk. You have 3 places to put it. Now the next largest disk, you still have 3 places to put this. Continue on, and each disk you will have exactly 3 choices of where to put it. Thus, there should be \[3^n\]arrangements.

KingGeorge
 2 years ago
Best ResponseYou've already chosen the best response.2And since larger disks must be below smaller disks, in every possible setting of the towers of hanoi, you can place the largest disk first, then the second largest, and so on.

experimentX
 2 years ago
Best ResponseYou've already chosen the best response.0isn't it 2^n  1 ?? I remember doing 2^n1 ... though i never thought behind it??

KingGeorge
 2 years ago
Best ResponseYou've already chosen the best response.2That's the minimum number of steps it takes to solve, not the different arrangements.

windsylph
 2 years ago
Best ResponseYou've already chosen the best response.0okay thank you.. i'm was thinking wrong, my first intuition was that the first peg can have n disks, the second, another n, and so continuing on this fashion i thought it was n^3. looks like i thought the other way around, I always get confused on these kinds of problems..

KingGeorge
 2 years ago
Best ResponseYou've already chosen the best response.2I still have that problem sometimes :/

windsylph
 2 years ago
Best ResponseYou've already chosen the best response.0haha but I think you got this one right though, thanks. it's like the question of how many functions from a set of m elements to n elements are there. haha
Ask your own question
Ask a QuestionFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.