Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

windsylph

  • 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
  1. KingGeorge
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    Someone 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.

  2. KingGeorge
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    And 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.

  3. experimentX
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    isn't it 2^n - 1 ?? I remember doing 2^n-1 ... though i never thought behind it??

  4. KingGeorge
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    That's the minimum number of steps it takes to solve, not the different arrangements.

  5. windsylph
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    okay 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..

  6. windsylph
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    i was*

  7. KingGeorge
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    I still have that problem sometimes :/

  8. windsylph
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    haha 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

  9. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Ask a Question
Find 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
  • 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.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.