Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Find the value of each of these quantities.

a) \(C(5,1)\)

b) \(C(5,3)\)

c) \(C(8,4)\)

d) \(C(8,8)\)

e) \(C(8,0)\)

f) \(C(12,6)\)

Short Answer

Expert verified

(a) The resultant answer is5.

(b)The resultant answer is10.

(c)The resultant answer is70.

(d)The resultant answer is1.

(e)The resultant answer is1.

(f) The resultant answer is 924.

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Given data

The given data is 12 horses.

02

Concept of Permutation

Definition permutation (order is important):P(n,r)=n!(nr)!

Definition combination (order is not important):C(n,r)=(nr)=n!r!(nr)!

with n!=n(n1)21.

03

Evaluate the definition of a combination

The order of the horses is important (since we want to determine the first, second and third position), thus we need to use the definition of permutation.

We will select 3 horses from the 12 horses (as we want to determine the top 3).

n = 12

r = 3

Evaluate the definition of a permutation:

P(12,3)=12!(123)!P(12,3)=12!9!P(12,3)=121110P(12,3)=1320

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

How many positive integers less than \({\rm{1000}}\)

a) have exactly three decimal digits?

b) have an odd number of decimal digits?

c) have at least one decimal digit equal to \({\rm{9}}\)?

d) have no odd decimal digits?

e) have two consecutive decimal digits equal to \({\rm{5}}\)?

f) are palindromes (that is, read the same forward and backward)?

a) Derive a formula for the number of permutations ofobjects of k different types, where there aren1 indistinguishable objects of type one,n2 indistinguishable objects of type two,..., andnk indistinguishable objects of type k.

b) How many ways are there to order the letters of the word INDISCREETNESS?

There are \({\rm{12}}\) signs of the zodiac. How many people are needed to guarantee that at least six of these people have the same sign?

Prove that if\(n\)and\(k\)are integers with\(1 \le k \le n\), then\(k \cdot \left( {\begin{array}{*{20}{l}}n\\k\end{array}} \right) = n \cdot \left( {\begin{array}{*{20}{l}}{n - 1}\\{k - 1}\end{array}} \right)\),

a) using a combinatorial proof. [Hint: Show that the two sides of the identity count the number of ways to select a subset with\(k\)elements from a set with n elements and then an element of this subset.]

b) using an algebraic proof based on the formula for\(\left( {\begin{array}{*{20}{l}}n\\r\end{array}} \right)\)given in Theorem\(2\)in Section\(6.3\).

4. Every day a student randomly chooses a sandwich for lunch from a pile of wrapped sandwiches. If there are six kinds of sandwiches, how many different ways are there for the student to choose sandwiches for the seven days of a week if the order in which the sandwiches are chosen matters?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free