2-21
k Permutation and Combination
u Permutation u Combination
• Be sure to specify Comp for Mode in the Setup screen.
Example 1 To calculate the possible number of different arrangements using 4
items selected from among 10 items
Formula Operation
10 P 4 = 5040
10 K6( g) 3(PROB) 2(
n P r ) 4 w
Example 2 To calculate the possible number of different combinations of 4 items
that can be selected from among 10 items
Formula Operation
10 C 4 = 210
10 K6( g) 3(PROB) 3(
n C r ) 4 w
k Greatest Common Divisor (GCD), Least Common Multiple (LCM)
Example Operation
To determine the greatest common
divisor of 28 and 35
(GCD (28, 35) = 7)
K6( g) 4(NUMERIC) 6( g) 2(GCD) 28
, 35 )w
To determine the least common multiple
of 9 and 15
(LCM (9, 15) = 45)
K6( g) 4(NUMERIC) 6( g) 3(LCM) 9
,15 )w
k Division Remainder (MOD), Remainder of Exponential Division
(MOD_Exp)
Example Operation
To determine the remainder when 137 is
divided by 7
(MOD (137, 7) = 4)
K6( g) 4(NUMERIC) 6( g) 4(MOD) 137
,7 )w
To determine the remainder when 5
3
is
divided by 3
(MOD_Exp (5, 3, 3) = 2)
K6( g) 4(NUMERIC) 6( g)
5(MOD_Exp) 5 ,3 ,3 )w
n
!
n
!
n
P
r
=
n
C
r
=
(
n
–
r
)!
r
!(
n
–
r
)!
n
!
n
!
n
P
r
=
n
C
r
=
(
n
–
r
)!
r
!(
n
–
r
)!
