Purchase Solution

Discrete structures combinations

Not what you're looking for?

Ask Custom Question

A women has 8 close friends.
(a) In how many ways can she invite five of these to dinner? Explain.
(i) Repeat part (a) with the added stipulation that two of her friends do not like each other so that if she invites one of them she cannot invite the other. Explain.
(ii) Repeat part (a), assuming that the eight friends consist of four single people and 2 married couples. If she invites a husband or wife she must invite the spouse. Explain.

Purchase this Solution
Solution Summary

The solution explains how to use the combination concept.

Solution Preview

(a) This is to select 5 out of 8. So there are C(8,5)=8!/(5!*3!)=56 ways.
(b) In the 56 ways in part (a), we remove the case that the two friends are ...

Purchase this Solution
Free BrainMass Quizzes
Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

View More Free Quizzes
Related BrainMass Solutions

  • Discrete math Subsets Contained

    = (18 x 19 x 20)/(1 x 2 x 3) = 3 x 19 x 20 = 380 combinations Therefore, Subsets with 1 element = 20 Subsets with 2 elements = 190 Subsets with 3 elements = 380 Thank you! The expert examines discrete math subsets contained.

  • Recurrence relations, compound interest, polynomials, number of combinations, & iteration

    339106 Recurrence relations, compound interest, polynomials Please help with the following discrete math involving recurrence relations, compound interest, polynomials, number of combinations and iteration. 14.

  • Proving Discrete Structures

    24810 Proving Discrete Structures Show all steps: Prove (( n )) = (( k + 1)) (( k )) = (( n - 1)) Please see the attached file. Thank you for using BrainMass. This solution provides a proof regarding discrete structures.

  • Mathematics - Discrete Structures

    The expert examines discrete structures in elements. A Complete, Neat and Step-by-step Solution is provided in the attached file.

  • How many solutions do the equation have

    I just don't understand how to determine how many combinations there are. Any help would be appreciated. -John How many solutions (X_1,...,X_6) have the equation X_1+ ... + X_6 = 10 Hello, I have a discrete math problem.

  • Discrete Structures : Onto and One-to-one

    The discrete structures of onto and one-to-one are determined.

  • Systems of equations

    This shows how to solve systems of equations in discrete structures. The systems of equations are solved.

  • Discrete Math: Integers

    498962 Discrete Math: Integers A US Social Security number is a nine-digit number. The first digit (or digits) may be zero. a) How many US Social Security numbers are available? b) How many US Social Security numbers are odd?

  • Statistics: bivariate normal distribution

    = 1 - (—2.96T) = .9985 The CLT can also be generalized so it applies to certain linear combinations.

  • Discrete structures

    44112 Discrete structures located We worked on the attached problems today in class I am now trying to work through them again for understanding and I am not getting very far.

View More Related Solutions