circle packing in an equilateral triangle (Q5121502)

From Wikidata
Jump to navigation Jump to search
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 number of circles,and conjectures are available for n<28
edit
Language Label Description Also known as
English
circle packing in an equilateral triangle
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 number of circles,and conjectures are available for n<28

    Statements

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit