enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. 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 aiming to get the greatest minimal separation, dn, between points. [1] To convert between these two formulations of the problem ...

  3. Nine-point circle - Wikipedia

    en.wikipedia.org/wiki/Nine-point_circle

    The nine-point circle is also known as Feuerbach's circle (after Karl Wilhelm Feuerbach), Euler's circle (after Leonhard Euler), Terquem's circle (after Olry Terquem), the six-points circle, the twelve-points circle, the n-point circle, the medioscribed circle, the mid circle or the circum-midcircle. Its center is the nine-point center of the ...

  4. Circle - Wikipedia

    en.wikipedia.org/wiki/Circle

    t. e. A circle is a shape consisting of all points in a plane that are at a given distance from a given point, the centre. The distance between any point of the circle and the centre is called the radius. The length of a line segment connecting two points on the circle and passing through the centre is called the diameter.

  5. Locus (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Locus_(mathematics)

    Each curve in this example is a locus defined as the conchoid of the point P and the line l.In this example, P is 8 cm from l. In geometry, a locus (plural: loci) (Latin word for "place", "location") is a set of all points (commonly, a line, a line segment, a curve or a surface), whose location satisfies or is determined by one or more specified conditions.

  6. 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, has a solution by an inductive method.

  7. Annulus (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Annulus_(mathematics)

    An annulus. Illustration of Mamikon's visual calculus method showing that the areas of two annuli with the same chord length are the same regardless of inner and outer radii. [ 1 ] In mathematics, an annulus (pl.: annuli or annuluses) is the region between two concentric circles. Informally, it is shaped like a ring or a hardware washer.

  8. Intersecting chords theorem - Wikipedia

    en.wikipedia.org/wiki/Intersecting_chords_theorem

    In Euclidean geometry, the intersecting chords theorem, or just the chord theorem, is a statement that describes a relation of the four line segments created by two intersecting chords within a circle. It states that the products of the lengths of the line segments on each chord are equal. It is Proposition 35 of Book 3 of Euclid 's Elements.

  9. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    The related circle packing problem deals with packing circles, possibly of different sizes, on a surface, for instance the plane or a sphere. The counterparts of a circle in other dimensions can never be packed with complete efficiency in dimensions larger than one (in a one-dimensional universe, the circle analogue is just two points). That is ...