Greatest common divisor and least common multiple matrices on factor closed sets in a principal ideal domain
Problem statement: Let T be a set of n distinct positive integers, x1, x2, ..., xn. The n×n matrix [T] having (xi, xj), the greatest common divisor of xi and xj, as its (i,j)-entry is called the greatest common divisor (GCD) matrix on T. The matrix [[T]] whose (i,j)-entry is [xi, xj], the least comm...
محفوظ في:
| المؤلف الرئيسي: | El-Kassar, A. N. (author) |
|---|---|
| مؤلفون آخرون: | Habre, S. S. (author), Awad, Y. A. (author) |
| التنسيق: | article |
| منشور في: |
2009
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/4894 https://doi.org/10.3844/jmssp.2009.342.347 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://thescipub.com/abstract/jmssp.2009.342.347 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Generalizations of Lehmer's equations, greatest common divisor matrices, and Euler's totient for a UFD
حسب: El-Kassar, A. M.
منشور في: (1991) -
GCD Matrices Defined on GCD-Closed Sets in Principal Ideal Domains
حسب: Habre Samer
منشور في: (2010) -
Testing and evaluating digital signature algorithms in principal ideal domains. (c2005)
حسب: Shebaro, Bilal M.
منشور في: (2005) -
The maximum common subgraph problem
حسب: Abu-Khzam, Faisal N.
منشور في: (2017) -
t-Reductions of Ideals in Integral Domains
حسب: unknown
منشور في: (2020)