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

in problems involving proportions, we can use cross products to test whether two ratios are equal and form a proportion. to find the cross products of a proportion, we multiply the outer terms, called the extremes, and the middle terms, called the means.

hope it

0.0076, if you meant 4.125 divided by 0.03125 it would be 132

step-by-step explanation:

first you have to move the decimal in 0.03125 over until its behind the 5 which is 5 places over. now the number is 3125

then you have to move the decimal in 4.125, 5 places over. now the number is 4,112,500.

now you divide like you would normally would and get 0.0076