Least common multiplier and greatest factorial factorization for Gosper's algorithm
Other Title(s)
المضاعف المشترك الأصغر و التحليل للعامل الأعظم لخوارزمية كوسبر
Joint Authors
Sad, Husam Luti
Abd Allah, Muhammad Khalaf
Source
Issue
Vol. 33, Issue 1A (31 Mar. 2015), pp.70-83, 14 p.
Publisher
University of Basrah College of Science
Publication Date
2015-03-31
Country of Publication
Iraq
No. of Pages
14
Main Subjects
Abstract AR
الهدف في هذا البحث هو إعطاء أسلوب خوارزمية كَوسبر التي تستخدم بكثرة في برهان المتطابقات التوافقية.
نعطي أسلوب خوارزمية كَوسبر باستخدام مفهومي التحليل للعامل الأعظم (GFF) و المضاعف المشترك الأصغر (lem).
هذا الأسلوب يمكن توسيعه للأسلوب المطابق -q.
نقدم مثال لتوضيح تطبيق أسلوبنا.
Abstract 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.
American Psychological Association (APA)
Sad, Husam Luti& Abd Allah, Muhammad Khalaf. 2015. Least common multiplier and greatest factorial factorization for Gosper's algorithm. Basrah Journal of Science،Vol. 33, no. 1A, pp.70-83.
https://search.emarefa.net/detail/BIM-542785
Modern Language Association (MLA)
Sad, Husam Luti& Abd Allah, Muhammad Khalaf. Least common multiplier and greatest factorial factorization for Gosper's algorithm. Basrah Journal of Science Vol. 33, no. 1A (2015), pp.70-83.
https://search.emarefa.net/detail/BIM-542785
American Medical Association (AMA)
Sad, Husam Luti& Abd Allah, Muhammad Khalaf. Least common multiplier and greatest factorial factorization for Gosper's algorithm. Basrah Journal of Science. 2015. Vol. 33, no. 1A, pp.70-83.
https://search.emarefa.net/detail/BIM-542785
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 81-82
Record ID
BIM-542785
