A jar contains 10 balls numbered 1, 2, 3, ... , 10. We draw 15 balls from the jar, one after another, with replacement. Let N denote the number of distinct numbers drawn. For instance, if the drawn balls are
Permutations and Combinations
If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba, cb and ca. It is in a particular order. So, this can be called the permutation of a, b, and c. But if the order does not matter then ab is the same as ba. Similarly, bc is the same as cb and ac is the same as ca. Here the list has ab, bc, and ac alone. This can be called the combination of a, b, and c.
Counting Theory
The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.
![A jar contains 10 balls numbered 1, 2, 3, ... , 10. We draw 15 balls from the jar, one after another, with replacement. Let N denote the number
of distinct numbers drawn. For instance, if the drawn balls are
4, 2, 3, 7, 8, 1, 1, 1, 4, 2, 5, 8, 4, 9, 5
then N = 8 because all numbers are drawn except for 6 and 10.
Find the expected value of N.
E[N] =
[Hint: Write N as a sum of appropriately defined Bernoulli random variables.]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdedaf66c-9d6b-4767-8ac3-3fbe3f8fd76c%2F3cbdc0f1-7104-48df-96a7-f52010d517f3%2Ferqvd7_processed.jpeg&w=3840&q=75)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
