12
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

A Proof of a Conjecture of Knuth

Pages 83-89 | Published online: 03 Apr 2012

REFERENCES

  • Andrews , G. E. 1996 . “PfafF's method III: comparison with the WZ method” . Electronic. J. Comb. , R21 : 18 [Andrews 1996]
  • Andrews , G. E. “Pfaff's method I: the Mills-Robbins-Rumsey determinant” [Andrews a], to appear in Discrete Math.
  • Andrews , G. E. “PfafF's method II: diverse applications” [Andrews b], to appear in J. Comput. Appl. Math.
  • Bailey , W. N. 1928 . “Products of generalized hypergeometric series” . Proc. London Math. Soc. , 28 : 242 – 254 . [Bailey 1928]
  • Gessel , I. and Stanton , D. 1982 . “Strange evaluations of hypergeometric series” . SIAM J. Math. Anal. , 13 : 295 – 308 . [Gessel and Stanton 1982]
  • Graham , R. L. , Knuth , D. E. and Patashnik , O. 1994 . Concrete Mathematics, A Foundation for Computer Science, , 2nd ed. Reading , MA : Addison-Wesley. . [Graham et al. 1994]
  • Karlsson , P. W. 1995 . Clausen's hypergeometric series with variable ¼J. Math. Anal. Appl. , 196 : 172 – 180 . [Karlsson 1995]
  • Knuth , D. E. 1994 . [Knuth 1994], letter of August 30, to the editor
  • Krattenthaler , C. “HYP and HYPQ: Mathematica packages for the manipulation of binomial sums and hypergeometric series, respectively -binomial sums and basic hypergeometric series”. ” . In J. Symb. Comput. Edited by: Paule , P. and Strehl , V. [Krattenthaler 1996], The software is available at, to appear in, (special issue on “Symbolic Computation in Combinatorics dgr;1”, ftp://pap.univie.ac.at
  • Paule , P. and Schorn , M. “A Mathematica version of Zeilberger's algorithm for proving binomial coefficient identities” [Paule and Schorn 1995], RISC-Linz, Report Series 95–10; to appear in J. Symb. Comput. (special issue on “Symbolic Computation in Combinatorics dgr;1”, edited by P. Paule and V. Strehl). The softare is available at ftp://ftp.risc.unilinz.ac.at/pub/combinatorics/mathematica/PauleSchorn
  • Takayama , N. “An algorithm for finding recurrence relations of binomial sums and its complexity”. ” . In J. Symb. Comput. (special issue on “Symbolic Computation in Combinatorics dgr;i” Edited by: Paule , P. and Strehl , V. [Takayama 1996]

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.