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
.png)
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
a The least number of moves for 3 disks is 7 2 3 1 4 disks ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
864-L-A-L-S (1189).docx
120 KBs Word File
