Permutation, Mathematics

Assignment Help:

A train goin from delhi to jaipur stops at 7 intermediate stations. 5 persons enter the train during the journey with 5 difefrent tickets of same class . How mant different set of tickets they could had??

Solution) This is the condition if they all board the train from Delhi, though if they can board the train from any station . so here is the solution

Every person can have two choices 1) Boarding Station 2)Destination

if B.S= Delhi Des=1,2,3,4,5,6,7,Jaipur = 8 choices

if B.S.= 1  Des=2,3,4,5,6,7,Jaipur = 7 choices

if B.S.= 2  Des=3,4,5,6,7,Jaipur = 6 choices

...

therefore the total type of tickets that a person can have =8+7+6+5+4+3+2+1 = 36choices

Likewise all the fove people can have these choices (May be recurring) .

Then the total choices may be 365

Though if they have different tickets then the permutation possible are 36*35*34*33*32


Related Discussions:- Permutation

The sum of their ages is 104 how old is shari, Sam's age is 1 less than dou...

Sam's age is 1 less than double Shari's age. The sum of their ages is 104. How old is Shari? Let x = Shari's age and let y = Sam's age. Because Sam's age is 1 less than twice S

Operation of fraction, what are the formula in the operation of fraction an...

what are the formula in the operation of fraction and how will i apply the operation of fraction on word problems

Find out the length of hamiltonian path, Find out the length of Hamiltonian...

Find out the length of Hamiltonian Path in a connected graph of n vertices. Ans: The length of Hamiltonian Path in a connected graph of n vertices is n-1.

Time and Work, A and B can finish a piece of work in 16 days and 12 days re...

A and B can finish a piece of work in 16 days and 12 days respectively.A started a work and worked at it for 2 days.He was then joined by B.Find the total time taken to finish the

Find the shortest weighted paths, 1. Answer the questions about the graph b...

1. Answer the questions about the graph below. a. Name one cycle that begins and ends at B. b. True/False - the graph is strongly connected.  If not, explain why not.

Obligatory application and interpretation problem, Obligatory application/i...

Obligatory application/interpretation problem : Next, we need to do our obligatory application/interpretation problem so we don't forget about them. Example : Assume that the

Factoring polynomials, Factoring polynomials is probably the most important...

Factoring polynomials is probably the most important topic. We already learn factor of polynomial .If you can't factor the polynomial then you won't be able to even start the probl

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