428
PROGRAM SHEET
Program for
Greatest Common Measure
Description
Euclidean general division is used to determine the greatest common measure for two
interers
a
and
b
.
For |
a
|, |
b
| < 10
9
, positive values are taken as < 10
10
(Overview)
n
0
=
max
(
|
a
|, |
b
|)
n
1
= min (|
a
|, |
b
|)
n
k
–2
n
k
=
n
k
–2
– –––
n
k
–1
n
k
–1
k
= 2, 3....
If
n
k
= 0, then the greatest common measure (
c
) will be
n
k
–1
.
Example
[1]
[2]
[3]
When
a
= 238
a
= 23345
a
= 522952
b
= 374
b
= 9135
b
= 3208137866
$
$
$
c
= 34
c
= 1015
c
= 998
Preparation and operation
• Store the program written on the next page.
• Execute the program as shown below.
Step Key operation
Display
Step Key operation
Display
No.
2
Содержание CFX-9970G
Страница 22: ... CFX 9970G ...
Страница 62: ...Manual Calculations 2 1 Basic Calculations 2 2 Special Functions 2 3 Function Calculations Chapter 2 ...
Страница 452: ...435 1 2 3 4 5 Program for Circle and Tangents No 4 Step Key Operation Display ...
Страница 453: ...436 Program for Circle and Tangents No 4 Step Key Operation Display 6 7 8 9 10 ...
Страница 454: ...437 11 12 13 14 15 Program for Circle and Tangents No 4 Step Key Operation Display ...
Страница 455: ...438 16 17 18 Program for Circle and Tangents No 4 Step Key Operation Display ...
Страница 458: ...441 1 2 3 4 5 Program for Rotating a Figure No 5 Step Key Operation Display ...