Skip to main content

[Community Question] Calculus: Find a number that have minimum sum of distances between set of numbers

One of our user asked:

Lets say we have a set of numbers { 5, 7, 1, 2, 5, 100 }, I want to find a number x such that the sum of distances of every number from the set to x is minimal.

My first thought was that x is the average of the sum of all element of the set: (sum / n), but it's not true it fail the above example.

Any help or hint will be appriciated, thanks.


Comments

Popular posts from this blog

[Community Question] Calculus: calculating 2 constants in a function

One of our user asked: $$M=\{f\in C[0,2\pi],\int_{0}^{2\pi}f(x)sinxdx=\pi,\int_{0}^{2\pi}f(x)sin2xdx=2\pi\} $$ $a,b\in \mathbb R, g\in M, g(x)=asinx+bsin2x,x\in [0,2\pi]$ I've read on the answers that $a=1,b=2$ and I don't know how to calculate them. Can somebody explain me,please? By the way, the problem is to determine $ \int_{0}^{2\pi}(g(x))^2 dx$ so you have to first get the constants $a$ and $b$ .

Calculus: A difficulty in understanding a step in a solution.

Here is the solution: But I could not understand how the last term in the fourth line came from the line before it, could anyone explain this for me please?