When.com Web Search

  1. Ads

    related to: word problems on circles and triangles worksheet kuta version pdf

Search results

  1. Results From The WOW.Com Content Network
  2. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    The optimal packing of 15 circles in a square Optimal solutions have been proven for n ≤ 30. Packing circles in a rectangle; Packing circles in an isosceles right triangle - good estimates are known for n < 300. Packing circles in an equilateral triangle - Optimal solutions are known for n < 13, and conjectures are available for n < 28. [14]

  3. Malfatti circles - Wikipedia

    en.wikipedia.org/wiki/Malfatti_circles

    Malfatti's assumption that the two problems are equivalent is incorrect. Lob and Richmond (), who went back to the original Italian text, observed that for some triangles a larger area can be achieved by a greedy algorithm that inscribes a single circle of maximal radius within the triangle, inscribes a second circle within one of the three remaining corners of the triangle, the one with the ...

  4. Dividing a circle into areas - Wikipedia

    en.wikipedia.org/wiki/Dividing_a_circle_into_areas

    The number of points (n), chords (c) and regions (r G) for first 6 terms of Moser's circle problem. In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides in such a way as to maximise the number of areas created by the edges and diagonals, sometimes called Moser's circle problem (named after Leo Moser), has a solution by an inductive method.

  5. Circle packing in a circle - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_a_circle

    Circle packing in a circle is a two-dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle. Table of solutions, 1 ≤ n ≤ 20 [ edit ]

  6. Circle packing in an equilateral triangle - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_an...

    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 number of circles, and conjectures are available for n < 28 .

  7. Circle packing in a square - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_a_square

    Circle packing in a square is a packing problem in recreational mathematics where the aim is to pack n unit circles into the smallest possible square. Equivalently, the problem is to arrange n points in a unit square in order to maximize the minimal separation, d n , between points. [ 1 ]

  8. Incircle and excircles - Wikipedia

    en.wikipedia.org/wiki/Incircle_and_excircles

    An excircle or escribed circle [2] of the triangle is a circle lying outside the triangle, tangent to one of its sides, and tangent to the extensions of the other two. Every triangle has three distinct excircles, each tangent to one of the triangle's sides.

  9. Word problem - Wikipedia

    en.wikipedia.org/wiki/Word_problem

    Word problem (mathematics education), a type of textbook exercise or exam question to have students apply abstract mathematical concepts to real-world situations; Word problem (mathematics), a decision problem for algebraic identities in mathematics and computer science; Word problem for groups, the problem of recognizing the identity element ...