Question

What type of counting problem is this?
A special safe lets you choose from 5 symbols for a 3-symbol-long pass code. You may enter a symbol any number of times. How many potential pass codes are there?
Permutation without repetition
Permutation with repetition
Combination with repetition
Combination without repetition

Answer 1

Hi friend

grab a coffee!

Make great sound!

Mark $<strong><em><u>as</u></em></strong><strong><em><u> </u></em></strong><strong><em><u> </u></em></strong><strong><em><u> </u></em></strong><strong><em><u>brainliest</u></em></strong><strong><em><u> </u></em></strong>$

Step-by-step explanation:

Permutation without repetition

1. In our school
2. Ok bye

Answer 2

Answer: It is an example of Combination with repetition.

Permutation: An arrangement of things in a certain sequence is what we refer to as a permutation. The constituents or components of sets are presented in this section in a sequential or chronological fashion. For instance, the number of possible permutations for the set A=1,6 is 2, such as "1,6," "6,1." As can be seen, there is no alternative possible configuration for the components that make up set A.

Combination: A coming together or merging of several parts or characteristics in which each of the constituent parts or traits retains its unique identity.

Step-by-step explanation:

Step 1: Given

Three symbol passcode

There are 5 symbols present

Step 2: Total Number of potential passcode

• Since repetition is allowed
• Therefore each of the 5 characters can be used max 3 times
• Or There one character twice or and the second character ones
• There if code is like this " - - - " Then at first second and third place any of the 5 characters could be entered.
• Number of combination possible are 5 X 5 X 5 = 125
• Therefore It is an example of Combination with repetition.

#SPJ2