摘要

Divided differences is an important tool in numerical approximation. In this paper we employ divided differences to give a new and unified proof of the well-known identities of Abel and Hagen-Rothe in combinatorial analysis.