Chapter 2: Main Application
53
Problem
Operation
Determine the greatest common divisors of {4, 3},
{12, 6}, and {36, 9}.
[iGcd]
{
4
,
3
}
,
{
12
,
6
}
,
{
36
,
9
}
)
w
u
“iLcm” Function
Syntax:
iLcm(Exp-1, Exp-2[, Exp-3…Exp-10)]
(Exp-1 through Exp-10 all are integers.)
iLcm(List-1, List-2[, List-3…List-10)]
(All elements of List-1 through List-10 are integers.)
Function:
• The first syntax above returns the least common multiple for two to ten integers.
• The second syntax returns, in list format, the least common multiple (LCM) for each of the elements in two to
ten lists. When the arguments are {
a
,
b
}, {
c
,
d
}, for example, a list will be returned showing the LCM for
a
and
c
,
and for
b
and
d
.
Description:
• All of the lists must have the same number of elements.
• When using the “iLcm(List-1, List-2[, List-3…List-10)]” syntax, one (and only one) expression (Exp) can be
include as an argument in place of a list.
Problem
Operation
Determine the least common multiples of {4, 3},
{12, 6}, and {36, 9}.
[iLcm]
{
4
,
3
}
,
{
12
,
6
}
,
{
36
,
9
}
)
w
u
“iMod” Function
Syntax:
iMod(Exp-1/List-1, Exp-2/List-2[)]
Function:
• This function divides one or more integers by one or more other integers and returns the remainder(s).
Description:
• Exp-1 and Exp-2, and all of the elements of List-1 and List-2 must be integers.
• You can use Exp for one argument and List for the other argument (Exp, List or List, Exp) if you want.
• If both arguments are lists, both lists must have the same number of elements.
Problem
Operation
Divide 21 by 6 and 7, and determine the remainder
of both operations. (iMod(21, {6, 7})
[iMod]
21
,
{
6
,
7
}
)
w
Permutation (
n
P
r
) and Combination (
n
C
r
)
u
Total Number of Permutations
u
Total Number of Combinations
Problem
Operation
To determine the number of permutations and combinations
possible when selecting four people from a group of 10
10
P
4
= 5040
}
10
,
4
w
10
C
4
= 210
{
10
,
4
w
3
²²²²²
²
&
²²²²²²²
²
