Say, the position of \(n\) is \(k^{th}\) from beginning.

\(k-1\) numbers would be in left of\(n\), and \(n - k\) numbers would be to its right, Select \(k-1\) numbers in the left in\({{n-1} \choose {k-1}}\) ways and arrange them in one order(increasing). Now the others would automatically be arranged in right of \(n\) in descending order in \(1\) way.

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestSay, the position of \(n\) is \(k^{th}\) from beginning.

\(k-1\) numbers would be in left of\(n\), and \(n - k\) numbers would be to its right, Select \(k-1\) numbers in the left in\({{n-1} \choose {k-1}}\) ways and arrange them in one order(increasing). Now the others would automatically be arranged in right of \(n\) in descending order in \(1\) way.

Hence , we conclude that :

No. of ways =\(\displaystyle \sum_{k = 2}^{n - 1} {{n-1} \choose {k-1}} = \boxed{2^{n-1} - 2}\)

Log in to reply