Casio fx-CG20 kPermutation and Combination, kGreatest Common Divisor (GCD), Least Common Multiple (LCM), Formula, Formula, Example, Example, Operation, Operation

kPermutation and Combination

u Permutation	u Combination
n!		n!
nPr = (n – r)!	nCr =
		r! (n – r)!
• 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
10P4 = 5040	10K6(g)3(PROB)2(nPr) 4w

Example 2 To calculate the possible number of different combinations of 4 items that can be selected from among 10 items

Formula	Operation
10C4 = 210	10K6(g)3(PROB)3(nCr) 4w

kGreatest Common Divisor (GCD), Least Common Multiple (LCM)

Example Operation

To determine the greatest common K6(g)4(NUMERIC)6(g)2(GCD) 28

divisor of 28 and 35,35)w (GCD (28, 35) = 7)

To determine the least common multiple K6(g)4(NUMERIC)6(g)3(LCM) 9

of 9 and 15,15)w (LCM (9, 15) = 45)

kDivision Remainder (MOD), Remainder of Exponential Division (MOD Exp)

Example	Operation
To determine the remainder when 137 is	K6(g)4(NUMERIC)6(g)4(MOD) 137
divided by 7	,7)w
(MOD (137, 7) = 4)
To determine the remainder when 53 is	K6(g)4(NUMERIC)6(g)
divided by 3	5(MOD Exp)5,3,3)w
(MOD Exp (5, 3, 3) = 2)

2-21