九州算术数学论坛's Archiver

LiuLe1986 发表于 2008-2-23 08:19

[求助]高中数学

设有一个共有n级的阶梯,某人每步可走1级,也可走2级,也可走3级,用递推公式给出某人从底层开始走完全部楼梯的走法。例如:当n=3时,共有4种走法,即1+1+1,1+2,2+1,3。<br>

ZhiJie 发表于 2008-2-23 08:19

[这个贴子最后由leebak在 2003/10/21 11:48pm 第 1 次编辑]<br /><br />先得出前六步的走法:<br />&nbsp; &nbsp;&nbsp; &nbsp;一步是1种走法<br />&nbsp; &nbsp;&nbsp; &nbsp;二&nbsp; &nbsp; 2<br />&nbsp; &nbsp;&nbsp; &nbsp;三&nbsp; &nbsp; 4<br />&nbsp; &nbsp;&nbsp; &nbsp;四&nbsp; &nbsp; 7=4+2+1<br />&nbsp; &nbsp;&nbsp; &nbsp;五&nbsp; &nbsp; 13=7+4+2<br />&nbsp; &nbsp;&nbsp; &nbsp;六&nbsp; &nbsp; 24=13+7+4<br />观察得出如上规律的话,那么第七步、第八步、……第n步的走法:&nbsp; &nbsp;&nbsp; &nbsp;<br />&nbsp; &nbsp;&nbsp; &nbsp;七&nbsp; &nbsp; 44 =24+13+7<br />&nbsp; &nbsp;&nbsp; &nbsp;八&nbsp; &nbsp; 81=44+24+13<br />&nbsp; &nbsp;&nbsp;&nbsp;……&nbsp; &nbsp; ……&nbsp; &nbsp;&nbsp; &nbsp;&nbsp;&nbsp;<br />故An(数列的第n项,即n步共有的走法)=&nbsp; &nbsp;An-1&nbsp; &nbsp;+&nbsp; &nbsp;An-2&nbsp; &nbsp;+&nbsp; &nbsp; An-3(An-1指数列的第n-1项,后面的两个符号依次类推)<br>

页: [1]

Powered by Discuz! Archiver 7.0.0  © 2001-2007 Comsenz Inc.