Proof of Combinatorial Identity Based on the Lattice Path Model
Yin Zhou-ping · Journal of Anqing Teachers College · 2007
Combinatorial identity is very important in combinatorial mathematics,and many methods can be used to prove it,for example,model conversion is the basic,simple and intuitive method in combinatorial counting.By using the lattice path model to combinatorial identity,it can be made very flexible to prove.It is necessary to seriously examine questions and observe the structures and similarities of each part firstly in the use of the method,then we can establish relevant models.