PERMUTATION AND COMBINATION

Find the number of ways of permuting the numbers 1,2,3,....n so that they are first increasing and then decreasing.

2^(n-1)-4 2^n-1 2^(n-1)-2 2^(n-2)-1

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.

1 solution

Sudipan Mallick
May 19, 2014

Let assume 1,2,3,4,5 now keeping 5 in the middle both side should have 12534. Now keep n in the middle we are left with n-1 numbers which are distributed in two groups one to the left of n and to the right of n. so the group size can b like this 1 and n-1 or 2 and n-2 or 3 and n-3....so on which can be done in (n-1)C1+(n-1)C2+(n-1)C3+....+n-1Cn-2=2^(n-1)-2.

good 1 ...... I knew the answer( u gave me this sum earlier )

Arijit Banerjee - 7 years ago

Log in to reply

Yeah that time i didnot solve the problem but latter when i did i post it over here. This question was asked in isi interview last year.

Sudipan Mallick - 7 years ago

Log in to reply

Yea u told me :)

Arijit Banerjee - 7 years ago

Log in to reply

@Arijit Banerjee oh! may be i forgot....

Sudipan Mallick - 7 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...