A permutation problem
Let A={1,2,…,n}. For a permutation P = { P(1) , P(2) , … , P(n) } of the elements of A, let P(1) denote the first element of P. Find the number of all such permutations P so that for that all i,j∈A if i < j < P(1) then j appears before i in P if P(1) < i< j then i appears before j in P
The answer is 0.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!