Ok, so it's not a sequence

[Andrew Weimholt]

On 2/5/08, David W. Wilson <wilson.d at anseri.com> wrote:

> At any rate, it's just a fun problem:
>
> Easy: Two distinct triangles in a plane are at distance 1 if they share a
> side. What is the maximum distance between two arbitrary triangles in a
> plane?
>

max distance is 3
If instead of triangles, we generalize to n-simplices, the max distance is n+1

>
> Harder: Two distinct triangles in a plane are at distance 1 if they share a
> side and the remaining vertex of one triangle lies on the other. Same
> question.
>

An upper bound on the max distance is 6
If we generalize to n-simplices, the upper bound on the max distance is 2(n+1)

Andrew