解题方法
1 . 汉诺塔(Tower of Hanoi),是一个源于印度古老传说的益智玩具. 如图所示,有三根相邻的标号分别为A、B、C的柱子, A柱子从下到上按金字塔状叠放着
个不同大小的圆盘,要把所有盘子一个一个移动到柱子B上,并且每次移动时,同一根柱子上都不能出现大盘子在小盘子的上方,请问至少需要移动多少次?记至少移动次数为
,例如:
,
,则下列说法正确的是( )
![](https://staticzujuan.xkw.com/quesimg/Upload/formula/b6a24198bd04c29321ae5dc5a28fe421.png)
![](https://staticzujuan.xkw.com/quesimg/Upload/formula/fd23d0f62b8a9a65f548a987709ebf41.png)
![](https://staticzujuan.xkw.com/quesimg/Upload/formula/6948a20e6292daa6dec7e1b1f81df75d.png)
![](https://staticzujuan.xkw.com/quesimg/Upload/formula/0e13f0b574e0464b11e8febe22f1cf73.png)
A.![]() | B.![]() |
C.![]() | D.![]() |
您最近一年使用:0次
2 . 数列
首项为
,接下来
项为
,再接下来
项为
,再后面
项为
,以此类推
( )
![](https://staticzujuan.xkw.com/quesimg/Upload/formula/83cf38189d5cbf627d2b82ac0eb76006.png)
![](https://staticzujuan.xkw.com/quesimg/Upload/formula/bdaa19de263700a15fcf213d64a8cd57.png)
![](https://staticzujuan.xkw.com/quesimg/Upload/formula/5ca7d1107389675d32b56ec097464c14.png)
![](https://staticzujuan.xkw.com/quesimg/Upload/formula/4dac452fbb5ef6dd653e7fbbef639484.png)
![](https://staticzujuan.xkw.com/quesimg/Upload/formula/d91e07104b699c4012be2d26160976a2.png)
![](https://staticzujuan.xkw.com/quesimg/Upload/formula/d3ffd5c35bba71ea54c28622b6cf505d.png)
![](https://staticzujuan.xkw.com/quesimg/Upload/formula/8b06e95b57b7a81cd81d05557a11fa92.png)
![](https://staticzujuan.xkw.com/quesimg/Upload/formula/1985174e05ad371e13cf24d244423da4.png)
![](https://staticzujuan.xkw.com/quesimg/Upload/formula/3caa08c5ed454787c3d3a66ca987460e.png)
A.![]() | B.![]() | C.![]() | D.![]() |
您最近一年使用:0次