
146
–––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––
m1(COMP) Mcl 522952 w B?
1
,
6
(DSP/CLR)
10 1
rr
rr
r15
5(Mcl) w E
–––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––
/
Program [RUN] 3208137866 w C
2
kk
kk
kPRIME FACTOR :CO
11 998
MEASURE :CO
–––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––
)w A?
3
E
–––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––
238 w B?
4
E
–––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––
374 w C
5
34
–––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––
w A?
6
1E2
–––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––
23345 w B?
7
34
–––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––
9135 w C
8
1E15
–––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––
w A?
9
4E6E
程序目的 No.
最大公約數
2
–––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––
步驟 鍵操作 顯示畫面 步驟 鍵操作 顯示畫面
程序用紙
n
k
– 2
n
k
= n
k
– 2 – –––– n
k
– 1
n
k
– 1
說明
利用 Euclidean 除法求出兩個整數a與b的最大公約數。
其中 |a|, |b| < 10
9
,正值時取 < 10
10
(概述)
n0 = max(|a|, |b|)
n
1 = min(|a|, |b|)
k
= 2, 3......
若n
k
= 0 , 則n
k
– 1即為最大公約數(c)。
範例 [1] [2] [3]
當 a = 238 a = 23345 a = 522952
b = 374 b = 9135 b = 3208137866
↓↓ ↓
c = 34 c = 1015 c = 998
準備與操作:
• 為程序的執行設定模式。
• 儲存列於下一頁上的程序。
• 按如下所示步驟執行程序。
Comentários a estes Manuais