i How many different ways can the podium be arranged? (The podium has a spot for only the 1st, 2nd and 3rd place horse) ii How many different ways can the horses finish the race such that Grand Valor, Seabiscuit and Secretariat do not finish first?

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Topic Video
Question

Help solving this please!

Notes to consider:

For part 1, A podium with (1st: horse A; 2nd: horse B; 3rd: horse C) is different than a podium with (1st: horse B; 2nd: horse C; 3rd: horse A). We're asking how many ways the 1st 2nd and 3rd horses could be.  Let H = {h_0, h_1, ... h_11} be the 12 horses in the race.  Here are two example ways the "podium" can be arranged: (h_3, h_7, h_2), (h_9, h_0, h_11)

For part 2,

Assume that horses may not share a placement (i.e. they can't "tie"). "Grand Valor, Seabiscuit and Secretariat do not finish first" means that: Grand Valor did not finish first AND Seabiscuirt did not finish first AND Secretariat did not finish first

For Part 3, 

i How many different ways can the podium be arranged? (The podium has a spot for only the
1st, 2nd and 3rd place horse)
ii How many different ways can the horses finish the race such that Grand Valor, Seabiscuit and
Secretariat do not finish first?
iii How many different ways can the horses finish the race such that one horse (Grand Valor)
always beats both Seabiscuit and Secretariat?
Transcribed Image Text:i How many different ways can the podium be arranged? (The podium has a spot for only the 1st, 2nd and 3rd place horse) ii How many different ways can the horses finish the race such that Grand Valor, Seabiscuit and Secretariat do not finish first? iii How many different ways can the horses finish the race such that one horse (Grand Valor) always beats both Seabiscuit and Secretariat?
Simplify each binomial coefficient or permutations to factorial fractions:
п!
n!
P(n, k) =
=
k
(n – k)!k!
(п — К)!
You need not simplify these expressions, such as 154 or 17!, in your response.
Transcribed Image Text:Simplify each binomial coefficient or permutations to factorial fractions: п! n! P(n, k) = = k (n – k)!k! (п — К)! You need not simplify these expressions, such as 154 or 17!, in your response.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Discrete Probability Distributions
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,