Search results
Results From The WOW.Com Content Network
Secant-, chord-theorem. For the intersecting secants theorem and chord theorem the power of a point plays the role of an invariant: . Intersecting secants theorem: For a point outside a circle and the intersection points , of a secant line with the following statement is true: | | | | = (), hence the product is independent of line .
The two given circles α and β touch the n circles of the Steiner chain, but each circle C k of a Steiner chain touches only four circles: α, β, and its two neighbors, C k−1 and C k+1. By default, Steiner chains are assumed to be closed , i.e., the first and last circles are tangent to one another.
The theorem can be reversed to say: for three circles intersecting at M, a line can be drawn from any point A on one circle, through its intersection C´ with another to give B (at the second intersection). B is then similarly connected, via intersection at A´ of the second and third circles, giving point C.
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.
Circle packing in a square is a packing problem in recreational mathematics, where the aim is to pack n unit circles into the smallest possible square. Equivalently, the problem is to arrange n points in a unit square aiming to get the greatest minimal separation, d n , between points. [ 1 ]
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 ]
The search engine that helps you find exactly what you're looking for. Find the most relevant information, video, images, and answers from all across the Web.
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.