Let be similar triangles (either directly or not) on a plane. The triangle has vertices named , , at random. We call these parent triangles.
Every pair of parent triangles has exactly one child triangle, which has vertices on the middle points of the segments , , connecting its parents.
No pair of parents has a degenerate child triangle.
Find the least such that, for every choice of the initial triangles, there exist at least one child triangle similar to its parents.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Relevant wiki: Similar Triangles - Problem Solving - Medium
Let a , b , c be complex numbers corresponding to the vertices of one parent triangle △ A B C in the complex plain and ω = c − b a − b be a spiral simmetry. A triangle mustpresent the same spiral simmetry (or the conjugate one) between some of its sides in order to be similar to △ A B C .
Let's say △ A B C mates with triangle △ X Y Z and their child is similar to, for example, △ A B C itself. Then: 2 ( c + z ) − 2 ( b + y ) 2 ( a + x ) − 2 ( b + y ) = ω ⇔ ( a − b ) + ( x − y ) = ω ( c − b ) + ω ( z − y ) ⇔ z − y x − y = ω If nothing strange happens (and we can make it not happen), than △ X Y Z and △ A B C must be directly similar to each other and X , Y , Z must be connected to A , B , C in this order!
Thus ( △ x , △ y ) have a child similar to them in any possible case iff they are directly similar and corresponding vertices have are named with the same letter. We can permute the vertices' name in 3 ! = 6 possible ways.
With 1 2 triangles only we could have half triangles clockwise similar and all differenlty labeled and the other half counterclokwise similar and equally differently labeled.
But if we have 1 3 triangles at least 7 must be directly similar by the pigeonhole principle!
Having 7 of them, at least 2 must have corresponding vertex equally named, again, by the pigeonhole principle!
Hence, we need n ≥ 1 3 .