Casio 3950P, Руководство по программированию

Страница: 5 / 48

3
01 Greatest Common Divisors
Given two natural numbers, and , the greatest common divisor may be found using
Euclid’s algorithm.
A
simplified explanation is given below:
１．
Let and be two natural numbers.
２．
Let be the remainder after dividing by .
３．
If , set and and return to 2.
４．
If =
0
, then is the greatest common divisor.
Program
Ｌｂｌ １：？→ Ａ：？→ Ｂ：Ｂ ＞ Ａ ⇒ Ｇｏｔｏ １：Ｌｂｌ ２：Ａ － Ｂ → Ａ：Ａ ≧ Ｂ
⇒ Ｇｏｔｏ ２：Ａ ＝０⇒ Ｇｏｔｏ ３：Ａ → Ｃ：Ｂ → Ａ：Ｃ → Ｂ：Ｇｏｔｏ ２：Ｌｂｌ
３：Ｂ ＜
60 STEP
＞
Execution Example:
Find the greatest common divisor of 210 and 60.
A B
Greatest common divisor
A B A B
> ( )
C A B
C 0
≠
B A
→
C B
→
C B
ON MODE MODE MODE
1
PRGM
MODE
1
COMP
1
P1
Prog 1 S A D R P1 P1 P2 P3 P4 G
210
EXE S A D R P1 P1 P2 P3 P4 G
60 EXE
S A D R P1 P1 P2 P3 P4 G
関数電卓事例集 .book 3 ページ ２００２年９月２日 月曜日 午後６時５１分