enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Carlyle circle - Wikipedia

    en.wikipedia.org/wiki/Carlyle_circle

    The defining property of the Carlyle circle can be established thus: the equation of the circle having the line segment AB as diameter is x(x − s) + (y − 1)(y − p) = 0. The abscissas of the points where the circle intersects the x-axis are the roots of the equation (obtained by setting y = 0 in the equation of the circle)

  3. Circular algebraic curve - Wikipedia

    en.wikipedia.org/wiki/Circular_algebraic_curve

    In terms of the polynomial F given above, the curve F(x, y) = 0 is p-circular if F n−i is divisible by (x 2 + y 2) p−i when i < p. When p = 1 this reduces to the definition of a circular curve. The set of p-circular curves is invariant under Euclidean transformations. Note that a p-circular curve must have degree at least 2p.

  4. Circle - Wikipedia

    en.wikipedia.org/wiki/Circle

    The equation of the circle determined by three points (,), (,), (,) not on a line is obtained by a conversion of the 3-point form of a circle equation: () + () () () = () + () () (). Homogeneous form In homogeneous coordinates , each conic section with the equation of a circle has the form x 2 + y 2 − 2 a x z − 2 b y z + c z 2 = 0 ...

  5. Unit circle - Wikipedia

    en.wikipedia.org/wiki/Unit_circle

    Thus, by the Pythagorean theorem, x and y satisfy the equation + = Since x 2 = (−x) 2 for all x, and since the reflection of any point on the unit circle about the x - or y-axis is also on the unit circle, the above equation holds for all points (x, y) on the unit circle, not only those in the first quadrant.

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

  7. Osculating circle - Wikipedia

    en.wikipedia.org/wiki/Osculating_circle

    The circle with center at Q and with radius R is called the osculating circle to the curve γ at the point P. If C is a regular space curve then the osculating circle is defined in a similar way, using the principal normal vector N. It lies in the osculating plane, the plane spanned by the tangent and principal normal vectors T and N at the ...

  8. Tangent lines to circles - Wikipedia

    en.wikipedia.org/wiki/Tangent_lines_to_circles

    If = + is the distance from c 1 to c 2 we can normalize by =, =, = to simplify equation (1), resulting in the following system of equations: + =, + =; solve these to get two solutions (k = ±1) for the two external tangent lines: = = + = (+) Geometrically this corresponds to computing the angle formed by the tangent lines and the line of ...

  9. Conway circle theorem - Wikipedia

    en.wikipedia.org/wiki/Conway_circle_theorem

    Conway's circle theorem as a special case of the generalisation, called "side divider theorem" (Villiers) or "windscreen wiper theorem" (Polster)) Conway's circle is a special case of a more general circle for a triangle that can be obtained as follows: Given any ABC with an arbitrary point P on line AB.