# Permutation with replacement

Permutation with replacement

In the previous explanation, permutation which we got is permutation where an objects is only used one time, or this is called permutation without replacement. Sometimes the objects provided can be used many times, and in this thing the permutation which is got is called permutation with replacement or permutation with recovery.

Suppose in forming the numeral which contain of 2 digits, which is taken from 3 numerals are provided, which are: 1, 2, and 3. If the numeral which are used can be repeated or is replaced after used before, we’ll get the numeral, which are:

11, 12, 13, 21, 22, 23, 31, 32, and 33

The number of permutation is equal to 9. Pay attention that 9=32. This permutation is called permutation with recovery or permutation with replacement or different arrangements with recovery.

If k of elements are taken from m of elements that are provided, where the element provided can be chosen repeatedly (permutation with recovery), then the number of permutation =mk.
Example 13:
a. Determine the number of numbers ehich is consist of 3 numerals which can be formed from the numerals: 1,

2, 3, 4.

b. Determine the number of the permutation (the arrangement that is different) which are possible in the tossing of a coin for 3 times.
a. Four numerals are provided, taken 3 numerals. The number of number which can be formed =43=64.
b. There are two sides of coin which are numeral (N) and image (E). The coin is tossed for 3 times. The number of permutation =23=8. The permutation are:
AAA, AAG, AGA, AGG, GAA, GAG, GGA, GGG

Exercise Competency Test 13

1. A coin is tossed 4 times. The number of different arrangements as the result of the tossing is equal to …
A. 16 B. 14 C. 8 D. 6 E. 4
A coin has two sides.
=24=16

2. Mr. Kardi has bag which can be loked by secret code. The code contains three numerals. The numeral which is used are from 0 until 9. The number of code which is possible which he make in his bag is equal to ….
A. 410 B. 310 C. 210 D. 103 E. 93

nums={0,1,2,3,4,5,6,7,8,9}→n(nums)=10
=103

3. A programmer wants to make a password which contain of 4 numerals. If the first numeral is always started by numeral 1 and the numerals are used can be repeated, then the number of passwords which can be made =…
A. 410 B. 310 C. 104 D. 103 E. 102 