Least common multiplier and greatest factorial factorization for Gosper's algorithm

الملخص EN

The objective of this paper is to give an approach of Gosper's algorithm that frequently used in proving combinatorial identities.

We give an approach for Gosper's algorithm by using greatest factorial factorization (GFF) and least common multiplier (lcm) concepts.

This approach can be easily extends to the q-analogues.

To illustrate the applicability of our approach, example is presented.