If you have the coordinates of 3 or more points in a 2D plane, how do you find the point that minimizes the total distance from that point to the other points? Also, is there a formula for this that can be easily memorized and used quickly in math competitions such as the AMC or AIME? I looked here (minimizing sum of distances) but I couldn't the exact formula that I was looking for.
I am aware that the point I am looking for is called the Fermat point but Wikipedia is not offering much other than a formula involving vectors, which I won't likely have the time or skill to use on competition day.