文件名称:COIN
介绍说明－－下载内容均来自于网络，请自行研究使用
一、问题叙述:
一摞硬币共m枚，每枚硬币均正面朝上。取最上面的1枚，将它们翻面后放回原处，然后取最上面的2枚硬币，将它们一起翻面后再放回原处。再取3枚，取4枚，…，直至整摞硬币都按上述方法处理过。接下来再从这摞硬币最上面的1枚开始，重复刚才的做法。这样一直下去，直到这摞硬币中的每一个又都是正面朝上为止。问这种情况是否一定出现？如果出现，则一共需做多少次翻面？-1, describes the problem: one pile a total of m gold coins, each coin are positive upward. Check the top one, turn them back into the original position after the noodle, then check the top two coins and put them together and then turned back into the original noodle. Re-admitted 3, take 4, ..., until the entire pile of coins are handled by the above method. Then again from the top of the pile of coins a start, just repeat the practice. This has been until this pile of coins in each one after another up to date are positive. Must ask whether this is happening? If there is need to make a total of how many times over noodle?
一摞硬币共m枚，每枚硬币均正面朝上。取最上面的1枚，将它们翻面后放回原处，然后取最上面的2枚硬币，将它们一起翻面后再放回原处。再取3枚，取4枚，…，直至整摞硬币都按上述方法处理过。接下来再从这摞硬币最上面的1枚开始，重复刚才的做法。这样一直下去，直到这摞硬币中的每一个又都是正面朝上为止。问这种情况是否一定出现？如果出现，则一共需做多少次翻面？-1, describes the problem: one pile a total of m gold coins, each coin are positive upward. Check the top one, turn them back into the original position after the noodle, then check the top two coins and put them together and then turned back into the original noodle. Re-admitted 3, take 4, ..., until the entire pile of coins are handled by the above method. Then again from the top of the pile of coins a start, just repeat the practice. This has been until this pile of coins in each one after another up to date are positive. Must ask whether this is happening? If there is need to make a total of how many times over noodle?
(系统自动生成,下载前可以参看下载内容)
下载文件列表
COIN_final.m