Kobon Triangle -- from Wolfram MathWorld
By A Mystery Man Writer
Description
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).
How to draw a Pascal triangle up to n=20 - Quora
Lune -- from Wolfram MathWorld, lune
Parallelian -- from Wolfram MathWorld
MEDIAN Don Steward mathematics teaching: Kobon triangles
List of unsolved problems in mathematics - Wikipedia
Kobon Triangles: number of nonoverlapping ?s from $n$ lines - Online Technical Discussion Groups—Wolfram Community
Kobon Triangle -- from Wolfram MathWorld
How to draw a Pascal triangle up to n=20 - Quora
Kobon triangle problem - Wikipedia
MEDIAN Don Steward mathematics teaching: Kobon triangles
Gergonne Line -- from Wolfram MathWorld
from
per adult (price varies by group size)