Pascal's triangle Construct a "d"-dimensional triangle (a 3-dimensional triangle is a tetrahedron) by placing additional dots below an initial dot, corresponding to P(1) = 1. Place these dots in a manner analogous to the placement of numbers in Pascal's triangle. To find P("x"), have a total of "x" dots composing the target shape. P("x") then equals the total number of dots in the shape. A 0-dimensional triangle is a point and a 1-dimensional triangle is simply a line, and therefore P("x") = "1" and P("x") = "x", which is the sequence of natural numbers. The number of dots in each layer corresponds
Circle packing in an equilateral triangle removing any single circle from the optimal hexagonal packing of circles. This conjecture is now known to be true for . Minimum solutions for the side length of the triangle: A closely related problem is to cover the equilateral triangle with a fixed number of equal circles, having as small a radius as possible. Circle packing in an equilateral triangle Circle packing in an equilateral triangle is a packing problem in discrete mathematics where the objective is to pack "n" unit circles into the smallest possible equilateral triangle. Optimal solutions are known for "n" < 13 and for any triangular