b

Forum Geometricorum Volume 1 (2001) 173–175.

b

b

FORUM GEOM ISSN 1534-1178

A Feuerbach Type Theorem on Six Circles Lev Emelyanov

According to the famous Feuerbach theorem there exists a circle which is tangent internally to the incircle and externally to each of the excircles of a triangle. This is the nine-point circle of the triangle. We obtain a similar result by replacing the excircles with circles each tangent internally to the circumcircle and to the sides at the traces of a point. We make use of Casey’s theorem. See, for example, [1, 2]. Theorem (Casey). Given four circles Ci , i = 1, 2, 3, 4, let tij be the length of a common tangent between Ci and Cj . The four circles are tangent to a fifth circle (or line) if and only if for appropriate choice of signs, t12 t34 ± t13 t42 ± t14 t23 = 0. B

C

O3 I

C1

O T

A

B1

B

A

O1 A1

C

O2

Figure 1

In this note we establish the following theorem. Let ABC be a triangle of side lengths BC = a, CA = b, and AB = c. Theorem. Let points A1 , B1 and C1 be on the sides BC, CA and AB respectively of triangle ABC. Construct three circles (O1 ), (O2 ) and (O3 ) outside the triangle which is tangent to the sides of ABC at A1 , B1 and C1 respectively and also tangent to the circumcircle of ABC. The circle tangent externally to these three circles is also tangent to the incircle of triangle ABC if and only if the lines AA1 , BB1 and CC1 are concurrent. Publication Date: December 13, 2001. Communicating Editor: Paul Yiu.

174

L. Emelyanov

Proof. Let in our case C1 , C2 , C3 and C4 be the circles (O1 ), (O2 ), (O3 ) and the incircle respectively. With reference to Figure 1, we show that t12 t34 − t13 t42 − t14 t23 = 0,

(1)

where t12 , t13 and t23 are the lengths of the common extangents, t34 , t24 and t14 are the lengths of the common intangents. Let (A) be the degenerate circle A(0) (zero radius) and ti (A) be the length of the tangent from A to Ci . Similar notations apply to vertices B and C. Applying Casey’s theorem to circles (A), (B), (O1 ) and (C), which are all tangent to the circumcircle, we have t1 (A) · a = c · CA1 + b · A1 B. From this we obtain t1 (A), and similarly t2 (B) and t3 (C): c · CA1 + b · A1 B , a a · AB1 + c · B1 C , t2 (B) = b b · BC1 + a · C1 A . t3 (C) = c Applying Casey’s theorem to circles (B), (C), (O2 ) and (O3 ), we have t1 (A) =

(2) (3) (4)

t2 (B)t3 (C) = a · t23 + CB1 · C1 B. Using (3) and (4), we obtain t23 , and similarly, t13 and t12 : a · C1 A · AB1 + b · AB1 · BC1 + c · AC1 · CB1 , (5) bc b · A1 B · BC1 + c · BC1 · CA1 + a · BA1 · AC1 , (6) t13 = ca c · B1 C · CA1 + a · CA1 · AB1 + b · CB1 · BA1 . (7) t12 = ab In the layout of Figure 1, with A , B  , C  the touch points of the incircle with the sides, the lengths of the common tangents of the circles (O1 ), (O2 ), (O3 ) with the incircle are a+b−c , (8) t14 = A1 A = −CA1 + CA = −CA1 + 2 b+c−a , (9) t24 = B1 B  = −AB1 + AB  = −AB1 + 2 c+a−b . (10) t34 = C1 C  = BC1 − BC  = BC1 − 2 Substituting (5)-(10) into (1) and simplifying, we obtain t23 =

t12 t34 − t13 t24 − t14 t23 = where

F (a, b, c) · (AB1 · BC1 · CA1 − A1 B · B1 C · C1 A), abc

F (a, b, c) = 2bc + 2ca + 2ab − a2 − b2 − c2 .

A Feuerbach type theorem on six circles

175

Since F (a, b, c) can be rewritten as (c + a − b)(a + b − c) + (a + b − c)(b + c − a) + (b + c − a)(c + a − b), it is clearly nonzero. It follows that t12 t34 − t13 t24 − t14 t23 = 0 if and only if AB1 · BC1 · CA1 − A1 B · B1 C · C1 A = 0. (11) By the Ceva theorem, (11) is the condition for the concurrency of AA1 , BB1 and CC1 . It is clear that for different positions of the touch points of circles (O1 ), (O2 ) and (O3 ) relative to those of the incircle, the proofs are analogous.  References [1] J. L. Coolidge, A Treatise on Circles and Spheres, 1917, Chelsea reprint. [2] I. M. Yaglom, Geometric Transformations, 3 volumes, Mathematical Association of America, 1968. Lev Emelyanov: 18-31 Proyezjaia Street, Kaluga, Russia 248009 E-mail address: [email protected]

A Feuerbach Type Theorem on Six Circles

Dec 13, 2001 - (or line) if and only if for appropriate choice of signs, t12t34 ± t13t42 ... From this we obtain t1(A), and similarly t2(B) and t3(C): t1(A) = c · CA1 + ...

32KB Sizes 1 Downloads 228 Views

Recommend Documents

A Fast Bresenham Type Algorithm For Drawing Circles
once the points are determined they may be translated relative to any center that is not the origin ( , ). ... Thus we define a function which we call the V+.3?=I

A Theorem on Orthology Centers
Sep 15, 2004 - bx x+z . In the notations of John H. Conway, the pedal A∗ of Oa on BC has homogeneous barycentric coordinates (0 : uSC + a2v : uSB + a2w).

A Note on the Feuerbach Point
Sep 4, 2001 - triangle ABC, the Feuerbach point F is the point of tangency with the incircle. There exists a family of cevian circumcircles passing through the ...

A NOTE ON THE TRACE THEOREM FOR DOMAINS ...
is to fill that gap and generalize that result for ω ⊂ Rn−1, n > 1, and arbitrary ..... the Texas Higher Education Coordinating Board, Advanced Research Program.

An Andô-Douglas Type Theorem in Riesz Spaces with a Conditional ...
subspaces of the Riesz space which are ranges of conditional expectation oper- ... conditional expectations on Riesz spaces specified in terms of their ranges ...

A Note on Grüss Type Inequality
In the years thereafter, numerous generalizations, extensions and variants of Grüss inequality .... integration, Indian J. Pure Appl. Math. 31(5), 475-494 (2000).

Circles .pdf
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. Circles .pdf.

A STRUCTURE THEOREM FOR RATIONALIZABILITY ...
under which rti (ai) is a best reply for ti and margΘXT−i. (πti,rti (ai)) = κti . Define a mapping φti,rti (ai),m : Θ* → Θ* between the payoff functions by setting. (A.5).

A STRUCTURE THEOREM FOR RATIONALIZABILITY IN ... - STICERD
We show that in any game that is continuous at infinity, if a plan of action ai is rationalizable ... Following Chen, we will use the notation customary in incomplete ...

Serviceable Reactive Programming on Vulnerable Data Type
Abstract. Serviceable Reactive Programming (SRP) is an approach to reactive programming where systems are structured as networks of functions operating on signals. SRP is based on the synchronous data-flow paradigm and supports both continuous time a

Information on Vitogate 200 type EIB - Groups
Service. Group. Data point read/write Data p.length¹ min. value2 max. value2 VS-Adress1. Operation HC1. Operating data HC1. Operating data write. 1-Byte. 0.

A STRUCTURE THEOREM FOR RATIONALIZABILITY IN ... - STICERD
particular, there, we have extensively discussed the meaning of perturbing interim ..... assumption that Bi (h), the set of moves each period, is finite restricts the ...

Inverse Halftoning Based on the Bayesian Theorem - IEEE Xplore
Abstract—This study proposes a method which can generate high quality inverse halftone images from halftone images. This method can be employed prior to ...

A Nonstandard Standardization Theorem
Rσ(k). → s with respect to an order ≺ (typically the left-to-right order). ... Reduce the leftmost redex at each step ... Dynamically: small-step operational semantics.

A Nonstandard Standardization Theorem
used to prove a left-to-right standardization theorem for the cal- culus with ES .... affect the final result nor the length of evaluation sequences (tech- nically, LHR ...

Green-Tao's theorem on k prime tuples.
Since. ∥. ∥. (. 1 − 1ΩK+1. ) E(f|BK+1). ∥. ∥. 2. L2(ZN ) are always bounded by 1 +o(1), after finite step K ≤ K0 = [2. 2 k. /ε + 2], we must have. fU Uk−1 = FK Uk−1 ≤ ε. 1/2 ... L∞ ≤ ε. (5). Hence BK is generated by OK,ε (1