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

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?

Short Answer

Expert verified

There are279,936 different ways for the student to choose sandwiches for the seven days of a week if the order in which the sandwiches are chosen matters.

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

Step 1: Definitions

Definition of Permutation (Order is important)

No repetition allowed:P(n,r)=n!(nr)!

Repetition allowed:nT

Definition of combination (order is important)

No repetition allowed:C(n,r)=nr=n!r!(nr)!

Repetition allowed:C(n+r1,r)=n+r1r=(n+r1)!r!(n1)!

withn!=n(n-1).....21

02

Step 2: Solution

The order of the elements matters (since we want to select the elements in order), thus we need to use the definition of permutation.

There are six kind of sandwiches and we select for seven days in a week

We are interested in selecting r = 7 elements from a set with n = 6 elements.

Repetition of elements is allowed (else student won’t have any sandwich on the seventh day).

nr=67=279,936

Thus there are 279,936ways in which seven elements can be selected in order from a set with six elements when repetition is allowed.

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

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

How many bit strings of length \({\rm{10}}\) over the alphabet \({\rm{\{ a,b,c\} }}\) have either exactly three \({\rm{a}}\)s or exactly four \({\rm{b}}\)s?

Prove the identity\(\left( {\begin{array}{*{20}{l}}n\\r\end{array}} \right)\left( {\begin{array}{*{20}{l}}r\\k\end{array}} \right) = \left( {\begin{array}{*{20}{l}}n\\k\end{array}} \right)\left( {\begin{array}{*{20}{l}}{n - k}\\{r - k}\end{array}} \right)\), whenever\(n\),\(r\), and\(k\)are nonnegative integers with\(r \le n\)and\(k{\rm{ }} \le {\rm{ }}r\),

a) using a combinatorial argument.

b) using an argument based on the formula for the number of \(r\)-combinations of a set with\(n\)elements.

This procedure is used to break ties in games in the championship round of the World Cup soccer tournament. Each team selects five players in a prescribed order. Each of these players takes a penalty kick, with a player from the first team followed by a player from the second team and so on, following the order of players specified. If the score is still tied at the end of the 10 penalty kicks, this procedure is repeated. If the score is still tied after 20 penalty kicks, a sudden-death shootout occurs, with the first team scoring an unanswered goal victorious.

a) How many different scoring scenarios are possible if the game is settled in the first round of 10 penalty kicks, where the round ends once it is impossible for a team to equal the number of goals scored by the other team?

b) How many different scoring scenarios for the first and second groups of penalty kicks are possible if the game is settled in the second round of 10 penalty kicks?

c) How many scoring scenarios are possible for the full set of penalty kicks if the game is settled with no more than 10 total additional kicks after the two rounds of five kicks for each team?e11x2

List all the permutations of {a,b,c}.

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