# Project #44702 - Discrete Math Basics

Instructions: Except for questions that ask for a simple True or False, complete solutions with details are required with reasons for each of the operations you perform to obtain a solution. For example, if the problem asks for a Proofthen we need to see all the steps of the argument as is given in your eResource textbook. (Discrete Structures

1. Prove that if 51 positive integers between 11 and 100 are chosen, then one of them must divide another.
2. How many distinct permutations are there of the characters in the word MONGOOSES?
3. Given a computer network with 60 switching nodes. In how many ways can one or two nodes fail?
4. Given a computer network with 60 switching nodes. If one node has failed, in how many ways can seven nodes be selected without encountering the failed node?
5. A cheese shop carries a large stock of 34 kinds of cheese. By the end of the day, 48 sales have been made, and the items sold must be restocked. How many different restocking orders are possible?
6. Explain why C(n, n-1) = C(n, 1).
7. In 5-card poker a hand is 5 cards dealt from a standard 52-card deck. How many hands contain two pairs (that is two pairs of different kinds plus a fifth card of some third kind.)?
8. How many distinct non-negative integer solutions are there to the equation
 x1 +x2 + x3 + x4 = 10
Hint: Think of this problem as distributing 10 pennies to 4 children.
9. In how many different ways can you seat 11 men and 9 women in a row if the men all sit together and the women all sit together?

 Subject Mathematics Due By (Pacific Time) 10/25/2014 12:00 pm
TutorRating
pallavi

Chat Now!

out of 1971 reviews
amosmm

Chat Now!

out of 766 reviews
PhyzKyd

Chat Now!

out of 1164 reviews
rajdeep77

Chat Now!

out of 721 reviews
sctys

Chat Now!

out of 1600 reviews

Chat Now!

out of 770 reviews
topnotcher

Chat Now!

out of 766 reviews
XXXIAO

Chat Now!

out of 680 reviews