In how many ways can we distribute 2 types of gifts? The problem: In how many ways can we distribut

il2k3s2u7 2022-05-23 Answered
In how many ways can we distribute 2 types of gifts?
The problem: In how many ways can we distribute 2 types of gifts, m of the first kind and n of the second to k kids, if there can be kids with no gifts?
From the stars and bars method i know that you can distribute m objects to k boxes in ( m + k 1 k 1 ) ways. So in my case i can distribute m gifts to k kids in ( m + k 1 k 1 ) ways, same for n gifts i can distribute them in ( n + k 1 k 1 ) ways. So now if we have to distribute m and n gifts we can first distribute m gifts in ( m + k 1 k 1 ) ways, then n gifts in ( n + k 1 k 1 ) ways, so in total we have:
( m + k 1 k 1 ) ( n + k 1 k 1 ) ways. .
Is my reasoning correct?
What about when we have to give at least 1 gift to each kid, can we do that in
( m 1 k 1 ) ( n + k 1 k 1 ) + ( n 1 k 1 ) ( m + k 1 k 1 ) ways?
You can still ask an expert for help

Want to know more about Discrete math?

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

Makai Blackwell
Answered 2022-05-24 Author has 11 answers
Explanation:
Your reasoning for the problem where kids with no gifts are allowed is correct. To solve the main problem you need to apply the PIE to exclude cases where one or more kids get no gift. You will obtain:
i = 0 k ( 1 ) i ( k i ) ( n + k 1 i n ) ( m + k 1 i m ) .
Not exactly what you’re looking for?
Ask My Question

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Relevant Questions

asked 2020-11-09
Use proof by Contradiction to prove that the sum of an irrational number and a rational number is irrational.
asked 2021-08-18
Discrete Mathematics Basics
1) Determine whether the relation R on the set of all Web pages is reflexive, symmetric, antisymmetric, and/or transitive, where (a,b)R if and only if
I) everyone who has visited Web page a has also visited Web page b.
II) there are no common links found on both Web page a and Web page b.
III) there is at least one common link on Web page a and Web page b.
asked 2021-07-28

Let A, B, and C be sets. Show that (AB)C=(AC)(BC)
image

asked 2021-08-02
Suppose that A is the set of sophomores at your school and B is the set of students in discrete mathematics at your school. Express each of these sets in terms of A and B.
a) the set of sophomores taking discrete mathematics in your school
b) the set of sophomores at your school who are not taking discrete mathematics
c) the set of students at your school who either are sophomores or are taking discrete mathematics
Use these symbols:
asked 2022-05-20
To find the number of ways to put 14 identical balls into 4 bins with the condition that no bin can hold more than 7 balls.
I have tried the following:
The total no of ways to distribute 14 identical balls into 4 bins without any restriction is
( 14 + 4 1 4 1 ) = ( 17 3 ) ..
Note that there can't be two bins with more than 7 balls since we have only 14 identical balls only.
Now, we count the no. of ways so that one bin has more than 7 balls. So, it has at least 8 balls and the remaining 6 can be distributed in ( 6 + 4 1 4 1 ) = ( 9 3 ) ways. We can choose one bin out of 4 in 4 ways.
Hence the reqd number of ways = ( 17 3 ) 4 × ( 9 3 ) .
asked 2022-05-17
Existence of a path of length n/2 in every bipartite graph with d ( A , B ) = 1 / 2
Claim: Let G = A B be a balanced bipartite graph with e ( A , B ) n / 2 then G has a path of length n/2.
I know about the erdos-gallai theorem that would net a path of length n/4. By noting that d ( G ) = 2 E ( G ) / V ( G ) n 2 / 4 n
I suspect that the condition of being bipartite forces the ecistence of a longer path, and I am yet unaware of such a result or a counterexample.
Part of my intuition is from the fact that considering a disjoint union of 2 copies of K n / 4 1 , n / 4 which are edge-maximal biparite graphs not containing such a path, we then have these two subgraphs and two yet to be connected vertices on A, also:
2 e ( K n / 4 1 , n / 4 ) = n 2 8 n 2 < n 2 / 8
And adding any edge would form a path of the desired length. Any help on how to go about proving this, or a reference for such a resukt would be greatly appreciated.
asked 2021-08-14
Whats the type of the following function in discrete math&
f:{1,2,3,4..}R
f(x) = 1/x

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question