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 1.if i < j < P(1) then j appears before i in P 2.if P(1) < i< j then i appears before j in P
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
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
There are no comments in this discussion.