1.) Answer with factorial notations and simplify into numbers.
- 1.1) Find the coefficients of x5 from the expansion of (2+x+x2)8
- 1.2) There're 10 people, including A,B,C,D. If we set them arrange in the long bench, find the number of different ways are there, such that only 2 of A,B,C,D are sitting together.
2.) Prove these statements by combinatorial proof.
2.1) k=0∑r(kr)2=(r2r) for any natural number r.
2.2) 25n3n(9n)! is always integer for any natural number n.
3.) Throw 15 6-sided regular dice, find the number of different ways such that every 6 different sides are shown and no more than 3 same sides are shown.
4.) Let V(r,n) be the number of ways of putting r different objects into n identical boxes such that each boxes must have at least k objects Prove that
V(r,n)=nV(r−1,n)+(r−kr−1)V(r−k,n−1)
for any natural number r,n,k and r≥nk.
5.) There was a rumour inside the group of 10 people. This rumour is spread by e-mail and continuously spread by following rules.
- First, there was only 1 people know about the rumour called rumour-er.
- Each e-mail can be either forwarded directly (exactly 1 people and can forward again) or people who receive copies (can be 0 people or any number of people, but cannot forward again)
- People who received the e-mail (by both ways) can know who sent the mail, and those are considered to be rumoured
- People who received by forwarding can only forward the mail once and only forward to people who are not rumoured.
- Rumour-er can send as many e-mails as he/she want.
How many ways are there if the e-mails are sent exactly 2 times, and how many ways if sent exactly 3 times?
This is the part of Thailand 1st round math POSN problems.
#Combinatorics
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
3) You are looking for the number of solutions to
a+b+c+d+e+f=15, subject to 1≤a≤3, and similarly for all the other variables.
Hint: Use the substitution z=3−a.
Log in to reply
Wow, this is nice! Thank you ^_^
2.) I use multiset to prove, but I forgot how to form a multiset.
Log in to reply
M={4n⋅a1,2n⋅a2,2n⋅a3,1n⋅a4} such that ∣M∣=9n.
Number of permutations = (4!)n(2!)n(2!)n(1!)n(9n)!=25n3n(9n)! which is always integer. Done!
I swear to goat that I haven't done this for years since the last year test.