The programming language MAPLE uses different algorithms to find closed forms for symbolic indefinite summations. MAPLE does not explicitly contain a procedure to interchange the order, and resultantly will give up on many summations which could be solved by interchanging the order of summation. In this project we look into the task of interchanging the order of summation over a specific domain, and provide a MAPLE procedure which automates this task. We then look into identities involving harmonic numbers which we derive through this new procedure, existing MAPLE summation techniques and user manipulation. We then analyze the well known algorithm Quicksort using these identities. Lastly, we look into the summation procedure by Moenck which is used for rational function summations.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Dailey, Matthew Daniel

Publisher

• Worcester Polytechnic Institute

Identifier

• E-project-050109-113911

Advisor

• Hofri, Micha

Year

• 2009

Date created

• 2009-05-01

Resource type

• Major Qualifying Project

Major

• Computer Science

Rights statement

• In Copyright