Write a full solution.
1.1) Find the number of ways that the word GIGGLING can be arranged such that the words can't start with vowels.
1.2) There're 50 numbers from 1 to 50. How many different ways can it be arranged in straight line such that odd numbers are arranged in increasing order and 2,4,6,8 must be next to each other (can be any order).
2.) (I feel like there's a problem in this question) Let be the number of ways of setting people sit on identical round tables such that each tables have at least people. Prove that
for all natural numbers and
3.) Let be natural numbers, prove these by combinatorial proof.
3.1)
3.2) is an integer.
4.) There're different gifts, give them to of the students (not necessary every gifts are given). If each students get more than gifts, find the number of ways to do that.
5.) There're people in a group (Brilli is one of them). Choose at least people and have them stand on a straight line. The rest of people, except Brilli, are sitting on a circular table. Find the number of ways to do that.
Check out all my notes and stuffs for more problems!
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.1) Consider 2n footballers, a cricketer "A" and a tennis player "B". We have to select n+1 of them.
DIRECT METHOD :- Total number of ways is (n+12n+2).
INDIRECT METHOD :- There are four cases, (a) Both A and B are selected (b)Only A is selected (c) Only B is selected (d) Neither A nor B is selected.
Number of ways in case (a) = (n−12n).Since A and B are chosen, we have to select the other n−1 players from the footballers.
Number of ways in case (b) = (n2n)..Since only A is chosen, we have to select the other n players from the footballers.
Number of ways in case (c) = (n2n).Since only B is chosen, we have to select the other n players from the footballers.
Number of ways in case (d) = (n+12n).Since neither A nor B is chosen, we have to select the other n+1 players from the footballers.
Since both the methods must give the same answer, we can conclude that (n+12n+2)=(n+12n)+(n2n)+(n2n)+(n−12n)
Log in to reply
Nice! You can also use Pascal's identity easily.