Purchase Solution

Counting and Set Theory

Not what you're looking for?

Ask Custom Question

How many ways can n books be placed on k distinguishable shelves?
a) if the books are indistinguishable copies of the same title?
b) if no two books are the same, and the positions of the books on the shelves matter?

How many ways are there to deal bands of five cards to each of six players from a deck containing 48 different cards?

How many ways are there to select three unordered elements from a set with five elements when repetition is allowed?

There are 2504 computer science students at a school. Of these, 1876 have taken a course in Java, 999 have taken a course in Linux, and 345 have taken a course in C. Further, 876 have taken courses in both Java and Linux, 231 have taken courses in both Linux and C, and 290 have taken courses in both Java and C. If 189 of these students have taken courses in Linux, Java and C, how many of these 2504 students have not taken a course in any of these three programming languages?

Attachments
Purchase this Solution
Solution Summary

Clear explanation and explanation has been provided for the attached questions.

Solution Preview

a. If the books are indistinguishable copies of the same title?
Solution:
There are k distinguishable shelves and n books are to be placed in them.
If the shelves are represented by space between two sticks | | and books are represented by *, then
| | * * * | | * * | | | ..... | (Total of k + 1 sticks for k shelves and n *s for n books)
Assume that the first and last sticks are fixed. Hence there are (k+1-2) + n items between the first and last sticks. Out of these n books have to be placed. Hence the number of ways = (k + 1 - 2 + n) C (n)
= (n + k - 1) C (n)

b. If no two books are the same, and the positions on the shelves matter?
Solution:
There are k distinguishable shelves and n distinguishable books.
For each book, there are k possible ...

Purchase this Solution
Free BrainMass Quizzes
Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Graphs and Functions

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

Probability Quiz

Some questions on probability

Exponential Expressions

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

Solving quadratic inequalities

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

View More Free Quizzes
Related BrainMass Solutions

  • Set Theory : Solve

    13094 Set Theory : Solve If A={1,3,4}, B={2,4,6,8), C=(1,4,5} and the universe is the counting numbers less than, then find the following: A. AUB(B has line over it) B. AU(BnC) Solution.

  • Counting Principle: Permutation Groups

    see attached This is a group theory proof regarding permutations and counting.

  • Set Theory and Counting

    Therefore, the set of positive integers and the set of negative integers do not form a partition of the set of integers. Solution to Q4. Please see attachment for solution. The solution discusses the set theory and counting.

  • Counting measure

    55326 Counting measure Definition: For any E in X, where X is any set, define M(E) = infinity if E is an infinite set, and let M(E) be then number of points in E if E is finite. M is called the counting measure on X.

  • Double slit problem

    This is also true for the matter-waves or the probability-waves of the quantum theory.

  • Counting Methods Roulette Wheel Diagrams

    455150 Counting Methods Roulette Wheel Diagrams Part I: Set Theory Look up a roulette wheel diagram.

  • Group Theory : Permutation Groups and Counting Principles

    89844 Group Theory : Permutaion Groups and Counting Principles Using O(N) = Σca for some choices of a in N , prove that in A5 there is no normal subgroup N other than (e) and A5 . Please see the attached file for the complete solution.

  • Using the Counting Principle in Probability Theory

    This solution shows how to apply the counting principle in probability theory to determine the number of points in a sample space.

  • Permutation Groups

    Modern Algebra Group Theory (CXI) Permutation Groups Another Counting Principle If O(G) =

  • Statistics

    202062 Elementary probability theory - A sale representative must visit 4 cities: Omaha, Dallas, Wichita, and Oklahoma City. Use the multiplication rule of counting to determine the ...

View More Related Solutions