Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2003

Fountains, histograms, and q-identities

Abstract

We solve the recursion S_n=S_n-1-q^nS_n-p, both, explicitly, and in the limit for n→∞, proving in this way a formula due to Merlini and Sprugnoli. It is also discussed how computer algebra could be applied.
Fichier principal
Vignette du fichier
dm060108.pdf (40.92 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00958993 , version 1 (13-03-2014)

Identifiers

Cite

Peter Paule, Helmut Prodinger. Fountains, histograms, and q-identities. Discrete Mathematics and Theoretical Computer Science, 2003, Vol. 6 no. 1 (1), pp.101-106. ⟨10.46298/dmtcs.336⟩. ⟨hal-00958993⟩

Collections

TDS-MACS
76 View
1064 Download

Altmetric

Share

More