Tim has an encyclopedia in 5 volumes: a–c, d–f, g–j, k–n, and o–z. other than alphabetically (ascending or descending), how many ways can these volumes be arranged?

a) 120
b) 118
c)25
d)insufficient data

is it a? !

Option: B is the correct answer.

            B) 118

We know that the arrangement of n item is given by :

                    n!

Here we have a total of 5 volumes that need to be arranged.

i.e. n=5

Hence, the number of ways of arranging these 5 volumes are:

              5!=5×4×3×2×1=120

Also, we have to exclude the case such that the ascending or descending order of arrangements are discarded.

i.e. we have to exclude two cases hence the remaining cases are:

                   120-2=118

( Since there is only one way of arranging all of them in increasing order and only one way of arranging all of them in decreasing order )

Hence, the number of ways these volume can be arranged are:

                                  118

98 points djdjsi zisksis sjsjsi sisksj sksjdj sksks sjsisj

answer: 204

step-by-step explanation:

we are told that the revenue is

x⋅(4080−10x)=−10x^2+4080x

this is a quadratic function, so to maximize it we should find the x-value of its vertex. recall that the x-value of the vertex of the parabola ax^2+bx+c is given by the formula −b/2a.

so in this case, we have a=−10 and b=4080, so the x-value of the vertex is

−b/2a= −(4080)/2(−10)=204