Determine the permutation, Mathematics

Assignment Help:

There are 6 contestants for the post of chairman secretary and treasurer. These positions can be filled by any of the 6. Find the possible no. of ways whether the 3 positions may be filled.

Solution

Chairman   Secretary   Treasurer

       6             5               4

Hence the no of ways of filing the three positions is 6 x 5 x 4 = 120

6P3 =   (6!)/((6 - 3)! )  

= (6 * 5 * 4 * 3 * 2 * 1) /(3 * 2 * 1)

= 720/6

= 120


Related Discussions:- Determine the permutation

Find out the tangent line to the parametric curve, Find out the tangent lin...

Find out the tangent line(s) to the parametric curve specified by X = t5 - 4t3 Y = t2 At (0,4) Solution Note that there is actually the potential for more than on

What is minimum spanning tree, What is minimum spanning tree?  Determine a ...

What is minimum spanning tree?  Determine a railway network of minimal cost for the cities in the following graph using Kruskal's algorithm. Ans: Minimum spanning tree in a con

Mensuration, a hollow cone is cut by a plane parallel to the base and the u...

a hollow cone is cut by a plane parallel to the base and the upper portion is removed. if the volume of the frustum obtained is 26/27 of volume of the cone. find at what height abo

Multiplacation, write and solve a problem of multiplacation that uses: esti...

write and solve a problem of multiplacation that uses: estimate explaning numbers picturs and another operation?

Ellpsoid, different kind of ellipsoid

different kind of ellipsoid

Shares and dividends, at what price 6.25% rs 100 share be quoted when the m...

at what price 6.25% rs 100 share be quoted when the money is worth 5%

How much can they deduct from childcare expenses, A family may deduct 24% o...

A family may deduct 24% of their childcare expenses from their income tax owed. If a family had $1,345 in childcare expenses, how much can they deduct? Find out 24% of $1,345 b

Solve the recurrence relation, Solve the recurrence relation T ...

Solve the recurrence relation T (K) = 2T (K-1), T (0) = 1 Ans: The following equation can be written in the subsequent form:  t n - 2t n-1 =  0  Here now su

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd