Permutation/combination problems

  • Thread starter Thread starter starsuck
  • Start date Start date
AI Thread Summary
Alice's problem involves calculating the number of sequences from rolling a die eight times, specifically focusing on sequences with exactly two occurrences of "6." The solution requires understanding permutations and combinations, particularly how to fix the positions of the "6"s and arrange the remaining numbers. Bob's coin toss problem asks for the number of ways to achieve exactly three blocks of consecutive heads from 13 heads and 7 tails, hinting at a combinatorial approach involving distributing items. Participants in the discussion emphasize the need for clarity on relevant formulas and methods to tackle these types of problems. The conversation highlights a common struggle with applying the correct combinatorial principles to solve these permutation and combination challenges.
starsuck
Messages
5
Reaction score
0
1. Alice rolls an ordinary six-sided die 8 times in succession, and the numbers are recorded (in order). How many possible outcome sequences contain exactly two occurrences of "6" Briefly explain your answer.

2.Bob tosses a coin 20 times and gets 13 heads and 7 tails. In how many ways can these tosses result in exactly three (non-empty) blocks of consecutive heads? For example, HHHTTHHHHHHHHHTTTHTT has three blocks of consecutive heads. Show all steps of your solution. (Hint: Think of distributing apples and oranges to children such that each child gets at least one apple.)

any help is appreciated. thanks in advance
 
Physics news on Phys.org
Well, the problem itself gives a hint! Show us what you have tried on this so we will know where you need help. Do you know anything about "permutations and combination"? What formulas do you have to use?
 
there is no specific formula that I need to use..
For question 2, I think I am able to use this formula though (n+r-1)/r
I have no idea how to apply this formula into that question.
please help me out here!
 
As an example, if there are 7 bananas, 6oranges, distributed to 4 children, such that each child gets at least 1 banana. in how many ways?

ans: (4+3-1)/3 * (4+6-1)/6
 
1. How many possible outcome sequences are there if out of eight throws, only one six is thrown?

Now, each of these sequences has one six "fixed" in position. How many ways are there to arrange another six in the remaining slots.

Now you have answered the above questions, can you answer the problem?

Do you know anything about permutations/combinations? Do you know a formula to work out such questions?
 
if one six is thrown 8 times, there will be 6*6*6*6*6*6*6*6, but I do not know how to get 2 consecutive of 6's.
 
starsuck said:
there is no specific formula that I need to use..
For question 2, I think I am able to use this formula though (n+r-1)/r
I have no idea how to apply this formula into that question.
please help me out here!
You titled this "Permutations and Combinations". Surely you learned several formulas for that! You certainly do not use "(n+r-1)/r". I you missing one or more "!" symbols?
 

Similar threads

Replies
14
Views
2K
Replies
45
Views
5K
Replies
2
Views
4K
Replies
4
Views
2K
Replies
18
Views
2K
Replies
1
Views
2K
Back
Top