You have 30 circular disks which when stacked from largest to smallest form a cone. The cone of disks are sitting over a wooden pole and sitting alongside are two more poles. You decide that you will attempt to move the disks from their current position to the pole at the end without at anytime allowing a larger disk to sit on top of a smaller disk. To achieve this you will use the middle pole and the current pole when needed.
If you move one disk every second,..how long will it take to move all the disks to the end pole,..from largest at the base to smallest at the top? Give your answer to the nearest whole number along with the units,...be they minutes, hours, weeks..etc.
At no time while doing the puzzle are you allowed to place a disk on the table or anywhere else, nor to have two disks on the move at the same time. Only one disk is to be held at anyone time, and that is the one being moved.
This problem requires no Calculus, rather a logical iterative approach is called for.
Ron.
If you move one disk every second,..how long will it take to move all the disks to the end pole,..from largest at the base to smallest at the top? Give your answer to the nearest whole number along with the units,...be they minutes, hours, weeks..etc.
At no time while doing the puzzle are you allowed to place a disk on the table or anywhere else, nor to have two disks on the move at the same time. Only one disk is to be held at anyone time, and that is the one being moved.
This problem requires no Calculus, rather a logical iterative approach is called for.
Ron.