25
.
3
0
1
,
5
3
(
r
.
.
.
Q
Q
.
5
0
1
,
5
3
(
r
.
.
.
Q
r
.
6
3
+
s
n
A
.
3
=
C
)
e
u
l
a
v
t
n
e
i
t
o
u
q
ll
a
c
e
r
(
.
5
=
D
)
e
u
l
a
v
r
e
d
n
i
a
m
e
r
ll
a
c
e
r
(
Operation
Display (Lower)
Display (Upper)
Least Common Multiple and Greatest Common Divisor
LCM: Calculate the least common multiple among (maximum)
three positive integers.
GCD: Calculate the greatest common divisor among (maximum)
three positive integers.
Quotient & Remainder
!
Inputting a zero [ 0 ] value in a LCM/ GCD calculation, the
calculator will skip the [0] value and continue the calculation with
the non-zero integers.
!
[Math ERROR] will be shown when decimal numbers or negative
integers had been input.
!
Only integers are allowed. [Math ERROR] will be shown when
decimal numbers, non-integers ( e.g. sin 60 ), or dividend value
"zero [ 0 ]" had been input.
!
Only Quotient Value (Q) can continue to be used for the next
calculation or being stored into memory variables.
"Quotient" (Q) is the result of a division problem, "Remainder"(r)
is the value left in an integer division problem.
The calculated quotient value (Q) and remainder value (r) will be
stored into memory variables "C" and "D" automatically
assigned.
Example:
35 10 = 3 x 10 + 5 ( 3 is Quotient, 5 is Remainder)
LCM(15, 27, 39) = 1755
1,755.
GCD(12, 24, 60) = 12
.
2
1
D
s
e
l
p
m
a
x
E
isplay (Lower)
Operation
