Question: There are three pegs on a board. On one peg are n disks, each smaller than the one on which it rests. The problem is

There are three pegs on a board. On one peg are n disks, each smaller than the one on which it rests. The problem is to move this pile of disks to another peg. The final order must be the same, but you can move only one disk at a time and can never place a larger disk on a smaller one.
There are three pegs on a board. On one peg

a) What is the smallest number of moves needed to move 3 disks? 4 disks? 2 disks? 1 disk?
b) Conjecture a formula for the smallest number of moves needed to move n disks. Prove it by mathematical induction.

Step by Step Solution

3.36 Rating (168 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a The least number of moves for 3 disks is 7 2 3 1 4 disks ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

864-L-A-L-S (1189).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!