Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.
Fun, engaging games to boost memory, math fluency, typing speed, and English skills—perfect for learners of all ages.
Enroll to start learning
You’ve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Listen to a student-teacher conversation explaining the topic in a relatable way.
Welcome, everyone! Today, we'll be discussing permutations where repetitions are allowed. Can anyone remind me what a permutation is?
A permutation is an ordered arrangement of items!
Exactly! So when we say repetitions are allowed, how does that change our calculations?
We can use the same item more than once!
Correct! And the formula to find the number of permutations when repetitions are allowed is n^r, where n is the number of objects and r is how many we want to arrange. Can you give me an example?
If we have 3 colors to use and want to make a pattern with 2 colors, we can have 3^2 = 9 different combinations.
Well done! Let's summarize what we learned today: Permutations are ordered, and when repetitions are allowed, we can multiply the number of choices for each slot.
Now let's look at some examples. Suppose we have 3 friends: Alice, Bob, and Charlie. If we want to form groups of 2 with possible repetitions, how many different groups can we form?
We can have Alice with Alice, Bob with Bob, and Charlie with Charlie too! So there are 9 combinations.
Exactly! That's right. You calculated this by thinking of each slot having 3 choices! Let’s move to combinations next.
What about combinations? How do those change with repetitions?
Great question! In combinations, we use a different formula when repetitions are allowed: C(n+r-1, r). Let’s explore this using our cash box example.
Before we conclude our session, it’s crucial to distinguish between permutations and combinations. Who can explain the difference?
Permutations are about the order of selection, while combinations do not care about order.
Absolutely! And when counting combinations with repetitions, we think of allocating indistinguishable objects, right?
Yes! Like dividing the number of dollars from various denominations in a cash box!
That’s a perfect example! Remember that distinguishing between ordered and unordered selections is key to solving problems effectively.
Finally, can anyone think of a real-world application for these concepts we discussed today?
Like organizing teams in a tournament where the same player can be part of multiple teams?
Exactly! In tournaments, recognizing how many ways we can arrange teams with the possibility of player repetition is crucial. Or how about selecting ice cream flavors where you can choose the same flavor more than once?
That’s a fun example! It shows how we encounter permutations with repetitions in games and decision making every day!
Well said! Understanding these concepts can help you approach various problems, whether in games or real-life situations.
Read a summary of the section's main ideas. Choose from Basic, Medium, or Detailed.
In this section, we delve into the rules surrounding permutations and combinations when repetitions are permitted. It covers key concepts such as the formulas for calculating permutations with repetitions allowed, and provides practical examples illustrating how these concepts can be applied in various contexts.
In this section, we explore the concept of permutations and combinations, specifically focusing on cases where repetitions of elements are permitted. A permutation is defined as an ordered arrangement of items, and the number of ways to select items can vary significantly based on whether repetitions are allowed.
Dive deep into the subject with an immersive audiobook experience.
Signup and Enroll to the course for listening the Audio Book
Now, we will consider the case where even in the selection, repetitions are allowed as well. So we are now interested to first find out the number of \( r \) permutations of a set of objects where I am allowed to have repetitions. For instance, if I consider a set with 3 persons; person 1, person 2, and person 3. Now if I ask you how many 2-permutations I can have over this set where I can repeat the person when I am forming the permutation...
In this part, we explore how permutations can change when we allow repeats. When forming permutations from a set of objects, allowing repetitions means that after choosing an object, you can choose it again for the next position. Using our previous example of 3 persons, let's say person 1, person 2, and person 3. If we want to create 2 permutations and repeating is allowed, we have increased our total potential arrangements. Now, every time we fill a position, we have three options instead of being restricted by the already chosen objects. Hence, the total number of 2-permutations would be \( 3^2 = 9 \).
Imagine you're creating passwords using the characters 'A', 'B', and 'C'. If you're allowed to use the same character multiple times, for a 2-character password, you can have 'AA', 'AB', 'AC', 'BA', 'BB', 'BC', 'CA', 'CB', and 'CC'. This shows how repetitions present a larger combination than if you couldn't repeat characters.
Signup and Enroll to the course for listening the Audio Book
So now again if I want to find out the number of \( r \)-permutations of \( n \) distinct elements where repetitions are allowed then it turns out to be the product of \( n \), \( r \) number of times. Because I have to fill \( r \) slots and the first slot can be occupied in \( n \) ways. And for each of those \( n \) ways in which I can occupy the first slot, I can fill the second slot also in \( n \) ways...
The formula for calculating the number of \( r \)-permutations when repetitions are allowed is straightforward. Since every slot can contain any of the \( n \) objects, for each of the \( r \) slots, you have \( n \) choices. Hence, the total number of permutations can be expressed mathematically as \( n^r \). This exponential calculation represents how each independent choice increases the total outcomes drastically.
Think of making ice cream sundaes with three different toppings: chocolate, sprinkles, and nuts. If you can choose 2 toppings for your sundae, you can have 'chocolate on chocolate', 'chocolate and sprinkles', and so on, leading to the combinations like 'sprinkles and nuts' or 'nuts and nuts'. With three choices for each topping and two slots to fill, the total combinations become \( 3^2 = 9 \).
Signup and Enroll to the course for listening the Audio Book
Now let's try to find out the number of \( r \)-combinations where repetitions are allowed and this is slightly tricky. Before going into the derivation of this formula, let me give you a motivating example...
In this section, we explore the concept of combinations where repetition is allowed. Unlike permutations, combinations do not consider the order of selection. The challenge here is to count the selections correctly when you can choose each item multiple times. The general formula for \( r \)-combinations with repetitions is given by \( C(n+r-1, r) \), which reflects the idea of filling slots while keeping track of boundaries between unique objects.
Imagine a candy jar that holds different types of candy (like chocolate, gummies, and hard candies). If you want to choose 3 candies from this jar but you can choose the same type more than once, it’s like putting a divider between each candy type and counting how many you pick. For instance, if you pick 3 pieces, you can have all three as chocolate, or one chocolate and two gummies. The challenge is figuring out how to count all the arrangements—including repetitions!
Learn essential terms and foundational ideas that form the basis of the topic.
Key Concepts
Permutations: Ordered arrangements of objects.
Combinations: Unordered selections of items.
Repetitions Allowed: Selecting the same item more than once.
See how the concepts apply in real-world scenarios to understand their practical implications.
Selecting 3 characters from a set of 3 where order matters can have 9 outcomes if repetitions are allowed.
Choosing ice cream flavors where you can select multiple scoops of the same flavor.
Use mnemonics, acronyms, or visual cues to help remember key information more easily.
When choosing in a line, order matters just fine; but if you can pick twice, every choice is a nice slice!
Imagine a candy shop where you can choose three candies, but you can take two of your favorite kinds - how many ways can you choose?
Remember: O - Order matters for permutations, U - Unordered for combinations.
Review key concepts with flashcards.
Review the Definitions for terms.
Term: Permutation
Definition:
An ordered arrangement of objects.
Term: Combination
Definition:
An unordered selection of items from a set.
Term: Repetition
Definition:
The act of selecting the same item more than once in a permutation or combination.
Term: Distinct Elements
Definition:
Items that are unique and not repeated.
Term: n^r
Definition:
Formula used for permutations with repetitions allowed, where n is the number of items, and r is how many are arranged.