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?

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

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.

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.

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

Looking for something else?

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

## More answers

Looking for something else?

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