Contents

Ars Combinatoria

  • Research article

A Combinatorial Proof of a General Two-Term Recurrence

Sabrina X.M.Pang1, Lun Lv2
1College of Mathematics and Statistics Hebei University of Economics and Business, Shijiazhuang 050061, P.R. China
2School of Sciences Hebci University of Science and Technology, Shijiazhuang 050018, P.R. China
  • Published: 31/01/2015

Abstract

We provide a concise combinatorial proof for the solution of the general two-term recurrence \(u(n, k) = u(n-1, k-1) + (a_{n-1}+b_{k})u(n-1, k)\), initially discovered by Mansour et al. \([4]\).

Citation
Sabrina X.M.Pang, Lun Lv. A Combinatorial Proof of a General Two-Term Recurrence[J], Ars Combinatoria, Volume 118. 429-431. .