A new algorithm on linear Diophantine equations

被引：0
|
作者：
Shi, Xiquan [1 ]
Liu, Fengshan [1 ]
Umoh, Hanson M. [1 ]
Gibson, Paul [1 ]
Hu, Zhitao [2 ]
机构：
[1] Delaware State Univ, Dept Appl Math & Theoret Phys, 1200 N Dupont HWY, Dover, DE 19901 USA
[2] Changan Univ, Xian, Peoples R China
来源：
DISCRETE AND COMPUTATIONAL MATHEMATICS | 2008年
关键词：
Diophantine equation; p-almost automorphic function; vanishing mean value; p-locally integrable; p-almost automorphic mild solutions;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let d = gcd(d(1), ..., d(n)) be the greatest common divisor (GCD) of counting numbers for d(1), ..., d(n). It is well known that there exist infinite sets of integers {k(i); 1 <= i <= n} satisfying the linear Diophantine equation c = Sigma(n)(k=1)d(i)k(i) iff d(i)vertical bar c, 1 <= i <= n, i.e., d(i) divides c. In this paper a new algorithm is presented to obtain a special solution of the linear Diophantine equation and a base of the corresponding homogeneous equation at the same time.
引用
收藏
页码：215 / +
页数：3
相关论文
共 50 条
12345