- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Least Common Multiplier and Greatest Factorial Factorization for Gosper's Algorithm | ||
| basrah journal of science | ||
| Article 1, Volume 33, Issue 1, 2015, Pages 70-83 PDF (0 K) | ||
| Authors | ||
| Husam L. Saad; Mohammed K. Abdullah | ||
| Abstract | ||
| 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 –analogues. To illustrate the applicability of our approach, example is presented. | ||
| Keywords | ||
| Gosper; hypergeometric solution; greatest factorial factorization; least common multiplier; rational solution; universal denominator | ||
|
Statistics Article View: 97 PDF Download: 87 |
||