Program for
Greatest Common Measure
Description
Euclidean general division is used to determine the greatest common measure for two interers
a and b
.
a
For |
(Overview)
n
= max
0
n
= min (|
1
n
=
n
k
k
= 2, 3....
If
n
= 0, then the greatest common measure (
k
Example
When
Preparation and operation
• Store the program written on the next page.
• Execute the program as shown below.
Step Key operation
PROGRAM SHEET
b
|, |
| < 10
9
, positive values are taken as < 10
(
|
a
|, |
b
|)
a
|, |
b
|)
n
k
–2
– –––
n
k
–2
k
–1
n
k
–1
[1]
[2]
a
= 238
a
= 23345
b
b
= 374
= 9135
↓
↓
c
c
= 34
= 1015
Display
10
c
) will be
[3]
a
= 522952
b
= 3208137866
↓
c
= 998
Step Key operation
No.
2
n
.
k
–1
Display
378