Greatest Common Divisors - Casio fx-3650P Programming Manual
Programmable scientific calculator
Hide thumbs
Also See for fx-3650P:
- User manual (61 pages) ,
- Product catalogue (16 pages) ,
- Specifications (1 page)
Table of Contents
Advertisement
01
Greatest Common Divisors
Given two natural numbers,
Euclid's algorithm. A simplified explanation is given below:
A
B
and
１．Let
C
be the remainder after dividing
２．Let
≠
C 0
B
, set
３．If
0
C
=
, then
４．If
ON
MODE
MODE
Ｌｂｌ １：？→ Ａ：？→ Ｂ：Ｂ ＞ Ａ ⇒ Ｇｏｔｏ １：Ｌｂｌ ２：Ａ － Ｂ → Ａ：Ａ ≧ Ｂ
⇒ Ｇｏｔｏ ２：Ａ ＝０⇒ Ｇｏｔｏ ３：Ａ → Ｃ：Ｂ → Ａ：Ｃ → Ｂ：Ｇｏｔｏ ２：Ｌｂｌ
３：Ｂ ＜ 60 STEP ＞
Find the greatest common divisor of 210 and 60.
Prog
1
EXE
210
60
EXE
A
B
and
be two natural numbers.
→
→
A
C
B
and
and return to 2.
B
is the greatest common divisor.
MODE
, the greatest common divisor may be found using
(
>
)
A B
A
B
by
.
PRGM
COMP
1
MODE
S A
S A
S A
1
1
P1 P1 P2 P3 P4
D R
P1 P1 P2 P3 P4
D R
P1 P1 P2 P3 P4
D R
G
G
G
3
Hide quick links:
Advertisement
Table of Contents
