RISC JKU

Combinatorial Identities by Zeilberger-Paule

Init
[Graphics:../Images/index_gr_50.gif]
[Graphics:../Images/index_gr_51.gif]
[Graphics:../Images/index_gr_52.gif]
[Graphics:../Images/index_gr_53.gif]
[Graphics:../Images/index_gr_54.gif]
[Graphics:../Images/index_gr_55.gif]
[Graphics:../Images/index_gr_56.gif]
Invent and Prove
[Graphics:../Images/index_gr_57.gif]
[Graphics:../Images/index_gr_58.gif]
[Graphics:../Images/index_gr_59.gif]
[Graphics:../Images/index_gr_60.gif]
[Graphics:../Images/index_gr_61.gif]
[Graphics:../Images/index_gr_62.gif]
[Graphics:../Images/index_gr_63.gif]
[Graphics:../Images/index_gr_64.gif]
[Graphics:../Images/index_gr_65.gif]

The simplification can be done by called Mathematica's simplifier:

[Graphics:../Images/index_gr_66.gif]
[Graphics:../Images/index_gr_67.gif]
A Nontrivial Example

Now we show another example, wich shows the mathematical power of the Gosper-Zeilberger-Paule-prover: The problem of constructing a closed form for the input expression in this example was an open problem for many years. The solution was given in P. Paule,  Computer-Solution of Problem 94-2, SIAM REVIEW Vol.37 (1995), 105-106.

[Graphics:../Images/index_gr_68.gif]
[Graphics:../Images/index_gr_69.gif]
[Graphics:../Images/index_gr_70.gif]
[Graphics:../Images/index_gr_71.gif]
[Graphics:../Images/index_gr_72.gif]
[Graphics:../Images/index_gr_73.gif]
[Graphics:../Images/index_gr_74.gif]
[Graphics:../Images/index_gr_75.gif]
[Graphics:../Images/index_gr_76.gif]

Again, the simplification can be accomplished by calling Mathematica's simplifier:

[Graphics:../Images/index_gr_77.gif]
[Graphics:../Images/index_gr_78.gif]
[Graphics:../Images/index_gr_79.gif]


Converted by Mathematica      June 17, 2002