DOAJ Open Access 2005

Human and constructive proof of combinatorial identities: an example from Romik

D. Merlini R. Sprugnoli M. C. Verri

Lihat Sumber DOI

Abstrak

It has become customary to prove binomial identities by means of the method for automated proofs as developed by Petkovšek, Wilf and Zeilberger. In this paper, we wish to emphasize the role of "human'' and constructive proofs in contrast with the somewhat lazy attitude of relaying on "automated'' proofs. As a meaningful example, we consider the four formulas by Romik, related to Motzkin and central trinomial numbers. We show that a proof of these identities can be obtained by using the method of coefficients, a human method only requiring hand computations.

Topik & Kata Kunci

Mathematics

Penulis (3)

D. Merlini

R. Sprugnoli

M. C. Verri

Format Sitasi

APA MLA BibTeX

Merlini, D., Sprugnoli, R., Verri, M.C. (2005). Human and constructive proof of combinatorial identities: an example from Romik. https://doi.org/10.46298/dmtcs.3377

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3377

Informasi Jurnal

Tahun Terbit: 2005
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3377
Akses: Open Access ✓