Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-00958993
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 4:59:37 PM
Last modification on : Sunday, April 26, 2020 - 1:34:02 PM
Long-term archiving on: : Friday, June 13, 2014 - 12:09:19 PM

File

dm060108.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00958993, version 1

Collections

Citation

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

Share

Metrics

Record views

215

Files downloads

921