The art of algorithmic guessing in gfun

Authors

  • Sergey Yurkevich University of Vienna and Inria Saclay

DOI:

https://doi.org/10.5206/mt.v2i1.14421

Keywords:

Guess and prove, P-recursive sequences, D-finite functions, algorithmic guessing, gfun

Abstract

The technique of guessing can be very fruitful when dealing with sequences which arise in practice. This holds true especially when guessing is performed algorithmically and efficiently. The ideal tool for it exists as a package named gfun in the software Maple. In this text we explore and explain some of gfun's possibilities and illustrate them on two examples from recent mathematical research by the author and his collaborators.

An orange monotonically increasing curve, bordered by equations

Downloads

Published

2022-09-05