Permutations - HP 12c Platinum Reference Manual

116 Statistics
12c platinum / 12C
RPN Keystrokes
fCLEARH
92\26t
85\30t
78\44t
81\50t
54\62t
51\68t
40\74t
g(003t
t

Permutations

A permutation is an ordered subset of a set of distinct objects. The number of possible
permutations, each containing n objects, that can be formed from a collection of m distinct
objects is given by:
where m, n are integers and 69 ≥ m ≥ n ≥ 0.
Use the following HP 12C Platinum program to calculate the number of possible
permutations.
12c platinum / 12C
RPN KEYSTROKES
fs
fCLEARÎ
?0
~
ge
gF
:0
-
ge
z
g(000
fs
12c platinum
ALG Keystrokes
fCLEARH
92³26t
85³30t
78³44t
81³50t
54³62t
51³68t
40³74t
g(003t
t
P
m n
DISPLAY
000,
001, 44
34 -
002,
003, 43
40 ³
004, 43
005, 45
30 ge
006,
007, 43
10 ~
008,
009,43,33,000 ge
Display
Total number of entries.
7.00
S
-354.14
xy
S'
-303.55
xy
m !
=
−
( m n )!
12c platinum
ALG KEYSTROKES
fs
fCLEARÎ
0 gF
3 ~
0 ~
3 z
³
g(000
fs
Comments
DISPLAY
000,
001, 43
002,
003,
004,
005,
006, 43
007,
008,
009, 43
010,
011,43,33,000
40
30
34
36
34
3
10
34
3
36