# Problem interpretation - Distance Formula?

If you've got multiple arrays like this:

(24,36,28,28,16,27)

(38,38,45,57,35,50)

every array being 6 integers, each integer in range [0,60]

I would like to find the distance between those 2 arrays. The problem is related to computer science, however, I would like to interpret these arrays as "planes" so as to find the distance between the two.

What's the best way to find the distance between those 2 arrays? Can we interpret them as 6 points on a plane? Or maybe 3 coordinates?

-
There's no "the" distance between two arrays, and no canonical interpretation of an array of six integers as a "plane." Thus, your problem is poorly stated. It's totally natural to want to compute some function that you haven't quite defined; in this case, what you can do is state some (mathematical!) properties you want the function to satisfy. Otherwise, it's difficult to narrow down the vast number of possible answers to the few that are going to be useful to you. – Darsh Ranjan Nov 5 '10 at 20:17
Excuse me: a distance is what i meant – Sev Nov 5 '10 at 20:22

You can interpret them any way you want, each array as three points in a plane (but using which order), two points in space, one point in six-dimensional space. There are various distances available. If you define the points as $a=(a_1,a_2,a_3,a_4,a_5,a_6)$ and similarly for $b$ you can use $\sum |a_i-b_i|$ or $\sum (a_i-b_i)^2$, for example. Note I didn't use the dimension at all.
@Sev, Slightly rephrased, you have a lot of the Hölder norms to pick: Ross already gave two, and there's also $\max|a_i-b_i|$. You will have to experiment on which one is appropriate. – J. M. Nov 5 '10 at 22:47