Suppose a friend of yours asks you to play a game. The game is the following: You have to pay your friend $25 to play the game (remember this) Your friend has a number (1 through 5) printed on each of 5 index cards as shown below: You friend shuffles these cards and places them face-down (i.e., you cannot see any of the numbers) on a table in front of you. You now are invited to turn over a card one at a time until you get the number 5. The game ends once you find the card with the number “5” You win the following amounts, based on how many cards you turned over until you find the card with the number 5: You first card turned over is “5” – you win $100 Your second card turned over is “5” – you win $50 Your third card turned over is “5” – you win $20 Your fourth card turned over is “5” – you win $10 Your fifth card turned over is “5” – you win $5 You decide to pay $25 to play the game. However, before doing so, you are wondering about how much money you will win or lose (keep in mind it cost you $25 each time you play the game), on average, if you played this game many times. You decide to run a simulation to address this question, where a single game is considered a trial. For your simulation, run 25 trials, and record how much you won (or lost) on each trial. You must show your results for all 25 trials and the random numbers you used for each trial. Finally, based on your simulation, what is your estimate of the average amount you would win or lose per game played?
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.
Suppose a friend of yours asks you to play a game. The game is the following:
- You have to pay your friend $25 to play the game (remember this)
- Your friend has a number (1 through 5) printed on each of 5 index cards as shown below:
- You friend shuffles these cards and places them face-down (i.e., you cannot see any of the numbers) on a table in front of you.
- You now are invited to turn over a card one at a time until you get the number 5. The game ends once you find the card with the number “5”
- You win the following amounts, based on how many cards you turned over until you find the card with the number 5:
- You first card turned over is “5” – you win $100
- Your second card turned over is “5” – you win $50
- Your third card turned over is “5” – you win $20
- Your fourth card turned over is “5” – you win $10
- Your fifth card turned over is “5” – you win $5
You decide to pay $25 to play the game. However, before doing so, you are wondering about how much money you will win or lose (keep in mind it cost you $25 each time you play the game), on average, if you played this game many times.
You decide to run a simulation to address this question, where a single game is considered a trial. For your simulation, run 25 trials, and record how much you won (or lost) on each trial. You must show your results for all 25 trials and the random numbers you used for each trial. Finally, based on your simulation, what is your estimate of the average amount you would win or lose per game played?
Trending now
This is a popular solution!
Step by step
Solved in 3 steps