More generally, suppose that k objects will be selected from a set of n objects, where and the k objects will

be placed in order from 1st to k th. Then there are n choices for the first object, choices for the second object, choices for the third object, and so on, until there are choices for the k th object. Thus, applying the multiplication principle, the number of ways to select and order k objects from a set of n objects is It is useful to note that , kn n 1 nk -+ 1 2 n ( 1)( 2) ( 1). nn n n k -- -+ " () ( 1)( 2) ( 1) ( 1)( 2) ( 1) () ! ()! nk nn n n k nn n n k nk n nk -- -+=-- -+ = "" ! !

This expression represents the number of permutations of n objects taken k at a time , that is, the number of ways to select and order k objects out of n objects. Example 4.3.5 : How many different five-digit positive integers can be formed using the digits 1, 2, 3, 4, 5, 6, and 7 if none of the digits can occur more than once in the integer? Solution : This example asks how many ways there are to order 5 integers chosen from a set of 7 integers. According to the counting pr inciple above, there are

( ) ( ) ( ) ( ) ( )
76543 2,520 = ways to do this. Note that this is equal to

( ) ( ) ( ) ( ) ( ) ( ) () ()()()()
76543. 765432! 7! (7 5)! 2! ==

Combinations Given the five letters A, B, C, D, and E, suppose th at you want to determine the number of ways in which you can select 3 of the 5 letters, but unlike before, you do not want to count different orders for the 3 letters. The following is a list of all of the ways in wh ich 3 of the 5 letters can be selected without regard to the order of the letters. ABC ABD ABE ACD ACE ADE BCD BCE BDE CDE There are 10 ways of selecting the 3 letters without or der. There is a relationship between selecting with order and selecting without order. The number of ways to select 3 of the 5 letters without order, which is 10, multiplied by the number of ways to order the 3 letters, which is 3 or 6, is equal to the number of ways to select 3 of the 5 letters and order them, which is !, 5! 60. 2! = In short, (number of ways to select without order) (number of ways to order) (number of ways to select with order) = This relationship can also be described as follows. 5! (number of ways to select with order) 5! 2! (number of ways to select without order) 10 (number of ways to order) 3! 3! 2! == = = More generally, suppose that k objects will be chosen from a set of n objects, where but that the k objects will not be put in order. The number of ways in

which this can be done is called t