Combinatorial Geometry Problem ( was: [EMHL] Euler Lines (O))
- --- In Hyacinthos@yahoogroups.com, "xpolakis" <xpolakis@...> wrote:
> Let 1,2,3,4,5,6 be six lines.Let 1,2,3,4,5,..., 2n (n > 2) be 2n lines no three passing through a
> Let 1 // 2 not // 3 // 4 not // 5 // 6 not // 1
> How many homethic triangles are there with no common vertex?
Assume that each one line in the set is parallel to only one line
in the set. ( n dyads of parallel lines)
How many dyads of triangles are formed having no vertex in common?
And how many homothetic dyads of triangles?