作者mqazz1 (無法顯示)
看板Math
標題[數論] Euclidean
時間Sat Aug 6 20:45:50 2011
The Euclidean Algorithm is used to product a sequence X1>X2>X3>X4>X5=0
of positive integers,where X(t) = Q(t+1)*X(t+1) + X(t+2)
t=1,2,3.The quotients are q2=3,q3=2,q4=2.which of the following is correct?
(a) gcd(X1,X2)= -2X1 + 6X2
(b) gcd(X1,X2)= -2X1 - 6X2
(c) gcd(X1,X2)= -2X1 - 7X2
(d) gcd(X1,X2)= 2X1 + 7X2
(e) gcd(X1,X2)= -2X1 + 7X2
原題
http://ppt.cc/MB,3
請問這題要怎麼解?
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 218.166.113.236
1F：→ ricestone :這就是輾轉相除法反算回去 08/06 20:48