enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. 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 ...

  3. Josephus problem - Wikipedia

    en.wikipedia.org/wiki/Josephus_problem

    The second time around the circle, the new 2nd person dies, then the new 4th person, etc.; it is as though there were no first time around the circle. If the initial number of people were even, then the person in position x during the second time around the circle was originally in position 2 x − 1 {\displaystyle 2x-1} (for every choice of x ).

  4. Haversine formula - Wikipedia

    en.wikipedia.org/wiki/Haversine_formula

    The haversine formula determines the great-circle distance between two points on a sphere given their longitudes and latitudes.Important in navigation, it is a special case of a more general formula in spherical trigonometry, the law of haversines, that relates the sides and angles of spherical triangles.

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

  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 (named after Leo Moser), has a solution by an inductive method.

  7. Smallest-circle problem - Wikipedia

    en.wikipedia.org/wiki/Smallest-circle_problem

    The algorithm selects one point p randomly and uniformly from P, and recursively finds the minimal circle containing P – {p}, i.e. all of the other points in P except p. If the returned circle also encloses p, it is the minimal circle for the whole of P and is returned. Otherwise, point p must lie on the boundary of the result circle.

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

  9. Dinostratus - Wikipedia

    en.wikipedia.org/wiki/Dinostratus

    Dinostratus' chief contribution to mathematics was his solution to the problem of squaring the circle. To solve this problem, Dinostratus made use of the trisectrix of Hippias, for which he proved a special property (Dinostratus' theorem) that allowed him the squaring of the circle.