- 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
Rising Greatest Factorial Factorization for Gosper's Algorithm | ||
| basrah journal of science | ||
| Article 1, Volume 32, Issue 1, 2014, Pages 1-12 PDF (0 K) | ||
| Author | ||
| Husam L. Saad Mohammed Kh. Abdullah | ||
| Abstract | ||
| In this paper we define the "rising greatest factorial factorization" (RGFF) of polynomials. It is a canonical form representation which can be viewed as an analogue to the greatest factorial factorization (GFF) [V.Z. Gathen and J. Gerhard, 1999, P.Paule, 1995], but with a positive integer shifts instead of negative integer shifts. We give lemma to compute the RGFF for any polynomial. We use this canonical representation and greatest common devisor (gcd) concept to give an approach for Gosper’s algorithm [R.W, Jr. Gosper, 1978]. | ||
| Keywords | ||
| Gosper; hypergeometric solution; greatest factorial factorization | ||
|
Statistics Article View: 92 PDF Download: 58 |
||