Let x1 < x2 < < xn be real numbers representing coordinates of n villages located along a straight road. a post office needs to be built in one of these villages. a. design an efficient algorithm to find the post-office location minimizing the average distance between the villages and the post office. b. design an efficient algorithm to find the post-office location minimizing the maximum distance from a village to the post office.

answer: sorry

step-by-step explanation: can you tell me pls how to find the rational of two integers

step-by-step explanation:

always plug in x. in this case, x equals 4.

i'm going to first solve 4(2+3x)

1) 4(2+3(4)) use pemdas to solve.

i'm going to multiply whats in the parenthesis first, so 3 times 4=12.

2)4 (2+12) i'm then going to multiply 4 by both numbers in the parenthesis (because multiplying comes before adding)

4 times 2= 8.   4 times 12= 48

4) (8+48)= 56 (answer)

i'm then going to solve 8+12x and plug in 4 for x.

1) 8 +12(4)

multiplying comes before adding, so i'm gonna multiply 12 and 4.

12 times 4= 48.

2) 8+48=56

both equal the same!

3

step-by-step explanation:

in standard form:

a= dictionaries

b= maps

you have to buy 3 dictionaries, so put a 3 next to the a (dictionaries) so that you can multiply them by each other.

a3+b= 60 (the amount of money you have)

we already know the cost of a=15 so replace a with $15

($15 x 3)+b=60

multiply 15 and 3 to get $45 and replace it with $45

45+b=60

and then replace b with 15 to get the total:

45+15=60

that means you have $15 left after buying 3 dictionaries.

15 divided by the cost of a map ($5) equals 3.

so you can buy 3 maps.

sorry if it was confusing!