Search results
Results from the WOW.Com Content Network
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.
Although successful in solving Apollonius' problem, van Roomen's method has a drawback. A prized property in classical Euclidean geometry is the ability to solve problems using only a compass and a straightedge. [18] Many constructions are impossible using only these tools, such as dividing an angle in three equal parts.
Determination of a circle, that intersects four circles by the same angle. [2] Solving the Problem of Apollonius; Construction of the Malfatti circles: [3] For a given triangle determine three circles, which touch each other and two sides of the triangle each. Spherical version of Malfatti's problem: [4] The triangle is a spherical one.
In general, the same inversion transforms the given circle C 1 and C 2 into two new circles, c 1 and c 2. Thus, the problem becomes that of finding a solution line tangent to the two inverted circles, which was solved above. There are four such lines, and re-inversion transforms them into the four solution circles of the original Apollonius ...
Apollonius' problem is to construct circles that are simultaneously tangent to three specified circles. The solutions to this problem are sometimes called the circles of Apollonius. The Apollonian gasket—one of the first fractals ever described—is a set of mutually tangent circles, formed by solving Apollonius' problem iteratively.
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 ...
Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!
In computer science and mathematics, the Josephus problem (or Josephus permutation) is a theoretical problem related to a certain counting-out game. Such games are used to pick out a person from a group, e.g. eeny, meeny, miny, moe. A drawing for the Josephus problem sequence for 500 people and skipping value of 6.