急~求mathematical induction題目

You can try this


A 2 by n “chessboard” is to be covered by two types of tiles, 2 by 1 and 2 by 2. As an
illustration, four of the 21 possible ways of covering a 2 by 5 chessboard are shown
below.
Show by Mathematical induction that the number of ways of covering a 2 by n “chessboard” by 2 by 1 tiles and 2 by 2 tiles is
1/3 (2^n+1 + (-1^n))

Hint: induction step is (P(k – 1) AND P(k – 2)) -->P(k).

It is a very tough MI question, can you please explain how to prove it step by step , please

http://hk.knowledge.yahoo.com/question/?qid=7006120301107&others=1

See Andy C.K.Ng 's answer above.

Below is a very difficult for F.4 level, you may take a look on it if you have time.
http://hk.knowledge.yahoo.com/question/?qid=7006112704910

你可以做一些Pure Math 題目
當中MI要求的技巧更加高深

你也可以做返二十多年前A.Math 的題目,挑戰性己很高

你有冇d唔識做既題目a?