enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Brahmagupta's formula - Wikipedia

    en.wikipedia.org/wiki/Brahmagupta's_formula

    In Euclidean geometry, Brahmagupta's formula, named after the 7th century Indian mathematician, is used to find the area of any convex cyclic quadrilateral (one that can be inscribed in a circle) given the lengths of the sides. Its generalized version, Bretschneider's formula, can be used with non-cyclic quadrilateral.

  3. Brahmagupta theorem - Wikipedia

    en.wikipedia.org/wiki/Brahmagupta_theorem

    More specifically, let A, B, C and D be four points on a circle such that the lines AC and BD are perpendicular. Denote the intersection of AC and BD by M. Drop the perpendicular from M to the line BC, calling the intersection E. Let F be the intersection of the line EM and the edge AD. Then, the theorem states that F is the midpoint AD.

  4. Circle theorem - Wikipedia

    en.wikipedia.org/wiki/Circle_theorem

    Circle theorem may refer to: Any of many theorems related to the circle; often taught as a group in GCSE mathematics. These include: Inscribed angle theorem. Thales' theorem, if A, B and C are points on a circle where the line AC is a diameter of the circle, then the angle ∠ABC is a right angle. Alternate segment theorem. Ptolemy's theorem.

  5. Gauss circle problem - Wikipedia

    en.wikipedia.org/wiki/Gauss_circle_problem

    Gauss's circle problem asks how many points there are inside this circle of the form (,) where and are both integers. Since the equation of this circle is given in Cartesian coordinates by x 2 + y 2 = r 2 {\displaystyle x^{2}+y^{2}=r^{2}} , the question is equivalently asking how many pairs of integers m and n there are such that

  6. Category:Theorems about circles - Wikipedia

    en.wikipedia.org/.../Category:Theorems_about_circles

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Pages for logged out editors learn more

  7. 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.

  8. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    These problems are mathematically distinct from the ideas in the circle packing theorem. 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 ...

  9. Problem of Apollonius - Wikipedia

    en.wikipedia.org/wiki/Problem_of_Apollonius

    René Descartes gave a formula relating the radii of the solution circles and the given circles, now known as Descartes' theorem. Solving Apollonius' problem iteratively in this case leads to the Apollonian gasket , which is one of the earliest fractals to be described in print, and is important in number theory via Ford circles and the Hardy ...