Discrete Math Question Help
Need Help with the discrete math question in the image below. You need to use the Deza-Frankl-Singhi theorem to solve it.
Newton28
33
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
- answered
- 1184 views
- $35.00
Related Questions
- Induction proof for an algorithm. Introductory level discrete math course. See attachment for details
- Combinatorics/counting: How many configurations are possible for m differenct objects in n boxes of unlimited occupany (m<n)
- Discrete Math/ Set theory Question
- Logic Question (𝐴→(𝐵→𝐶))→((𝐴→𝐵)→(𝐴→𝐶))
- Proof by induction the following recursive equation
- Logic Question 𝐴→(𝐵→𝐶),𝐴→𝐵,𝐴⊢𝐶
- Discrete Test
- Inclusion-Exclusion and Generating Function with Coefficient (and Integer Equation)
Low bounty for such an advanced question.
I don't know how advanced it is, what would an appropriate bounty be?
Do you have a reference book to look up some definitions?
I don't have a book. What definitions do you need help with?
By a system you men a collection of sets that is closed under inclusion, right? And what do you mean by a system of (2p-1) subsets?
Yes that is correct