Kobon Triangle -- from Wolfram MathWorld
5 (234) · $ 13.99 · In stock
Kobon Fujimura asked for the largest number N(n) of nonoverlapping triangles that can be constructed using n lines (Gardner 1983, p. 170). A Kobon triangle is therefore defined as one of the triangles constructed in such a way. The first few terms are 1, 2, 5, 7, 11, 15, 21, (OEIS A006066). It appears to be very difficult to find an analytic expression for the nth term, although Saburo Tamura has proved an upper bound on N(n) of |_n(n-2)/3_|, where |_x_| is the floor function (Eppstein).
Bisecting envelopes of convex polygons - ScienceDirect
Fuhrmann Triangle -- from Wolfram MathWorld
Fuhrmann Triangle -- from Wolfram MathWorld
Kobon triangles
List of unsolved problems in mathematics - Wikipedia
Rahmadi tutorial wolfram alpha
Obtuse Triangle -- from Wolfram MathWorld
Kobon Triangle -- from Wolfram MathWorld
Kobon Triangles: number of nonoverlapping ?s from $n$ lines - Online Technical Discussion Groups—Wolfram Community
Fuhrmann Triangle -- from Wolfram MathWorld
Parallelian -- from Wolfram MathWorld
PDF) Congruent triangles in arrangements of lines
:max_bytes(150000):strip_icc()/Triangles_AShortStudyinContinuationPatterns2_2-bdc113cc9d874d31bac6a730cd897bf8.png)
