Extension of gosper’s algorithm and greatest factorial factorization
Other Title(s)
توسيع لخوارزمية كوسبر و التحليل للعامل الأعظم
Author
Source
Journal of Basrah Researches : Sciences
Issue
Vol. 37, Issue 4D (30 Sep. 2011)5 p.
Publisher
University of Basrah College of Education for Pure Sciences
Publication Date
2011-09-30
Country of Publication
Iraq
No. of Pages
5
Main Subjects
Abstract AR
في هذا البحث نوسع خوارزمية كوسبر [4] باستخدام مفهوم التحليل للعامل الأعظم (GFF), الذي قدمه بأول [5], و العامل المشترك الأعظم (gcd) لإيجاد قيمة المجموع.
tk.(K) ∑_(k=0)^(n-1)▒P
Abstract EN
In this paper we extend Gasper’s algorithm [4], by using “Greatest Factorial Factorization” (GFF), introduced by Paule [5], and “greatest common divisor” (gcd) concepts to find the value of the summation ∑_ n-1K = 0 P (K).
t k.
American Psychological Association (APA)
Abd Allah, Muhammad Khalaf. 2011. Extension of gosper’s algorithm and greatest factorial factorization. Journal of Basrah Researches : Sciences،Vol. 37, no. 4D.
https://search.emarefa.net/detail/BIM-286014
Modern Language Association (MLA)
Abd Allah, Muhammad Khalaf. Extension of gosper’s algorithm and greatest factorial factorization. Journal of Basrah Researches : Sciences Vol. 37, no. 4D (Sep. 2011).
https://search.emarefa.net/detail/BIM-286014
American Medical Association (AMA)
Abd Allah, Muhammad Khalaf. Extension of gosper’s algorithm and greatest factorial factorization. Journal of Basrah Researches : Sciences. 2011. Vol. 37, no. 4D.
https://search.emarefa.net/detail/BIM-286014
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references.
Record ID
BIM-286014
