Combinatorics problem. how many permutations of the set [n] are there in which no internal entry is larger that both of its neighbors? (internal = not at the end points) [n] = {1, 2, n-1, n}

can i use the equation:

k! (n-k)! to solve this? i'm not sure how to show the internal entry part of the problem

what? ?

what type of question is thiss

step-by-step explanation:

set each factor equal to 0

4x-3 = 0

2x-1 = 0

solve for x.

4x-3=0

4x=3

x= 3/4

solve for x. 

2x-1= 0

2x= 1

x= 1/2

eventually after a few more steps, your answer should be 1/2 is less than or equal to x and 3/4 is greater than or equal to x

no

explanation:

you can be freinds, and people but not follow people.