enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. List of impossible puzzles - Wikipedia

    en.wikipedia.org/wiki/List_of_impossible_puzzles

    Squaring the circle, the impossible problem of constructing a square with the same area as a given circle, using only a compass and straightedge. [ 7 ] Three cups problem – Turn three cups right-side up after starting with one wrong and turning two at a time.

  3. Special cases of Apollonius' problem - Wikipedia

    en.wikipedia.org/wiki/Special_cases_of_Apollonius...

    CLP problems generally have 4 solutions. The solution of this special case is similar to that of the CPP Apollonius solution. Draw a circle centered on the given point P; since the solution circle must pass through P, inversion in this [clarification needed] circle transforms the solution circle

  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. Problem of Apollonius - Wikipedia

    en.wikipedia.org/wiki/Problem_of_Apollonius

    Consider a solution circle of radius r s and three given circles of radii r 1, r 2 and r 3. If the solution circle is externally tangent to all three given circles, the distances between the center of the solution circle and the centers of the given circles equal d 1 = r 1 + r s, d 2 = r 2 + r s and d 3 = r 3 + r s, respectively.

  6. Gauss circle problem - Wikipedia

    en.wikipedia.org/wiki/Gauss_circle_problem

    This problem is known as the primitive circle problem, as it involves searching for primitive solutions to the original circle problem. [9] It can be intuitively understood as the question of how many trees within a distance of r are visible in the Euclid's orchard , standing in the origin.

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

  8. List of circle topics - Wikipedia

    en.wikipedia.org/wiki/List_of_circle_topics

    Smallest circle problem – Finding the smallest circle that contains all given points; Tammes problemCircle packing problem; Tarski's circle-squaring problemProblem of cutting and reassembling a disk into a square; Thales' theorem; Circle tangents in non-geometric theory. Circle criterion

  9. Goat grazing problem - Wikipedia

    en.wikipedia.org/wiki/Goat_grazing_problem

    A circle containing one acre is cut by another whose center is on the circumference of the given circle, and the area common to both is one-half acre. Find the radius of the cutting circle. The solutions in both cases are non-trivial but yield to straightforward application of trigonometry, analytical geometry or integral calculus.