Search results
Results from the WOW.Com Content Network
In geometry, Descartes' theorem states that for every four kissing, or mutually tangent circles, the radii of the circles satisfy a certain quadratic equation. By solving this equation, one can construct a fourth circle tangent to three given, mutually tangent circles. The theorem is named after René Descartes, who stated it in 1643.
Due to the Pythagorean theorem the number () has the simple geometric meanings shown in the diagram: For a point outside the circle () is the squared tangential distance | | of point to the circle . Points with equal power, isolines of Π ( P ) {\displaystyle \Pi (P)} , are circles concentric to circle c {\displaystyle c} .
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.
There are either one or two solutions. Case 4: two angles and an included side given (ASA). The four-part cotangent formulae for sets (cBaC) and (BaCb) give c and b, then A follows from the sine rule. Case 5: two angles and an opposite side given (AAS). The sine rule gives b and then we have Case 7 (rotated). There are either one or two solutions.
An inversion in their tangent point with respect to a circle of appropriate radius transforms the two touching given circles into two parallel lines, and the third given circle into another circle. Thus, the solutions may be found by sliding a circle of constant radius between two parallel lines until it contacts the transformed third circle.
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.
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.
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 ]