Difference between revisions of "Combinatorics Challenge Problems"
(→Problem 1) |
(→Problem 2) |
||
| Line 4: | Line 4: | ||
Answer: <math>(420)</math> | Answer: <math>(420)</math> | ||
| + | |||
==Problem 2== | ==Problem 2== | ||
| Line 9: | Line 10: | ||
How many ways are there to seat <math>6</math> people around the circle if <math>3</math> of them insist on staying together?(All people are distinct) | How many ways are there to seat <math>6</math> people around the circle if <math>3</math> of them insist on staying together?(All people are distinct) | ||
| − | Answer: (36) | + | Answer: <math>(36)</math> |
| − | |||
==Problem 3== | ==Problem 3== | ||
Revision as of 09:31, 23 April 2020
Problem 1
How many distinguishable towers consisting of 
blocks can be built with 
red blocks, 
pink blocks, and yellow blocks?
Answer: 
Problem 2
How many ways are there to seat 
people around the circle if 
of them insist on staying together?(All people are distinct)
Answer: 
Problem 3
When fair sided dice are rolled, what is the probability that the sum of the numbers facing up top is 
?
Answer: (
)
