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

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.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

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

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

A coin is flipped eight times where each flip comes up either heads or tails. How many possible outcomes

a) are there in total?

b) contain exactly three heads?

c) contain at least three heads?

d) contain the same number of heads and tails?

Prove the hockeystick identity\(\sum\limits_{k = 0}^r {\left( {\begin{array}{*{20}{c}}{n + k}\\k\end{array}} \right)} = \left( {\begin{array}{*{20}{c}}{n + r + 1}\\r\end{array}} \right)\).whenever\(n\)and\(r\)are positive integers,

a) using a combinatorial argument.

b) using Pascal's identity.

Give a formula for the coefficient ofxkin the expansion of(x+1/x)100, where kis an integer.

Show that if nand kare integers with1kn, then(nk)nk/2k1

An ice cream parlour has \({\rm{28}}\) different flavours, \({\rm{8}}\) different kinds of sauce, and \({\rm{12}}\) toppings.

a) In how many different ways can a dish of three scoops of ice cream be made where each flavour can be used more than once and the order of the scoops does not matter?

b) How many different kinds of small sundaes are there if a small sundae contains one scoop of ice cream, a sauce, and a topping?

c) How many different kinds of large sundaes are there if a large sundae contains three scoops of ice cream, where each flavour can be used more than once and the order of the scoops does not matter; two kinds of sauce, where each sauce can be used only once and the order of the sauces does not matter; and three toppings, where each topping can be used only once and the order of the toppings does not matter?

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