# Combinatorics Questions: Card Pairs, Letter Arrangements, and Number Sequences

Problem 1. Suppose we draw 9 cards from a standard 52-card deck. Find the probability that your 9-card hand consists of exactly 4 (distinct) pairs. Assume the cards are drawn at the same time (so order does not matter). To receive full credit you must provide correct explanations in your solution.

Problem 2. Consider the word

YABADABADOO

With sufficient explanation, find the number of ways to arrange it provided:

(i) [2 points] there are no restrictions.

(ii) [2 points] all the A's are consecutive.

(iii) [7 points] none of the A's are consecutive.

(iv) [9 points] neither BAD nor YOO appear.

Problem 3. Find the number of length-6 sequences (so order matters) from the numerical digits

{1,2,3,4,5,6,7,8,9}

such that the sequence uses exactly 3 different digits. To receive full credit you must provide correct explanations in your solution.

## Answer

**Answers can only be viewed under the following conditions:**

- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.

1 Attachment

- answered
- 182 views
- $125.00

### Related Questions

- Probability of picking a red ball
- Help Resolving Questions
- Logic Question π΄∨π΅→πΆβ’(π΄→πΆ)∧(π΅→πΆ)
- Induction proof for an algorithm. Introductory level discrete math course. See attachment for details
- Logic Question π΄→(π΅→πΆ),π΄→π΅,π΄β’πΆ
- Logic Questions (π΄→πΆ)∧(π΅→πΆ)β’(π΄∧π΅)→πΆ
- Discrete Structures - Proving a statement false by proving the negation to be true
- Markov Process Problem