Permutation, Mathematics

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

Posted Date: 3/11/2013 1:07:46 AM | Location : United States







Related Discussions:- Permutation, Assignment Help, Ask Question on Permutation, Get Answer, Expert's Help, Permutation Discussions

Write discussion on Permutation
Your posts are moderated
Related Questions
Describe about Arithmetic and Geometric Series? When the terms of a sequence are added together instead of separated by commas, the sequence becomes a series. You will use seri

how to explain this strategy? how to do this strategy in solving a problem? can you give some example on how to solve this kind of strategy.

What are the marketing communications for Special K


Mathematics Is All Around Us :  What is the first thing you do when you get up? Make yourself a nice cup of tea or coffee? If so, then you're using mathematics! Do you agree? Cons

The backwards Euler difference operator is given by for differential equation y′ = f(t, y). Determine the order of the local truncation error. Explain why this difference o

Characteristics of Exponential Smoothing 1. More weight is described to the most recent data. 2. All past data are incorporated not like in moving averages. 3. Les

Marc goes to the store with exactly $1 in change. He has at least one of each coin less than a half-dollar coin, but he does not have a half-dollar coin. a. What is the least nu

Evaluate the convergence of the algorithms: From the convergence proof of power method, LR and QR algorithm for the computation of eigenvalues we see that the easiest case to