Triangles and Groups via Cevians
نویسندگان
چکیده
For a given triangle T and a real number ρ we define Ceva’s triangle Cρ(T ) to be the triangle formed by three cevians each joining a vertex of T to the point which divides the opposite side in the ratio ρ ∶ (1 − ρ). We identify the smallest interval MT ⊂ R such that the family Cρ(T ), ρ ∈ MT , contains all Ceva’s triangles up to similarity. We prove that the composition of operators Cρ, ρ ∈ R, acting on triangles is governed by a certain group structure on R. We use this structure to prove that two triangles have the same Brocard angle if and only if a congruent copy of one of them can be recovered by sufficiently many iterations of two operators Cρ and Cξ acting on the other triangle.
منابع مشابه
Complementary Halfspaces and Trigonometric Ceva–brocard Inequalities for Polygons
The product of ratios that equals 1 in Ceva’s Theorem is analyzed in the case of non-concurrent Cevians, for triangles as well as arbitrary convex polygons. A general lemma on complementary systems of inequalities is proved, and used to classify the possible cases of non-concurrent Cevians. In the concurrent case, particular consideration is given to the Brocard configuration defined by equal a...
متن کاملA Triangular Adventure
It all starts with an elegant construction and surprising discovery made by Karleen Davis and Sam Johnson, students in my "Cat:Dog" ("Circles and Triangles: Diamonds of Geometry") class this semester. Karleen and Sam were just playing around, looking for interesting things to do with a triangle. One thing they tried was this. Starting with a random triangle ABC, they took H, its orthocenter, an...
متن کاملA Generalization of Routh's Triangle Theorem
For a given triangle T and a real number ρ we define Ceva’s triangle Cρ(T ) to be the triangle formed by three cevians each joining a vertex of T to the point which divides the opposite side in the ratio ρ ∶ (1 − ρ). We identify the smallest interval MT ⊂ R such that the family Cρ(T ), ρ ∈ MT , contains all Ceva’s triangles up to similarity. We prove that the composition of operators Cρ, ρ ∈ R,...
متن کاملSome finite groups with divisibility graph containing no triangles
Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...
متن کاملSimilar Triangles, Another Trace of the Golden Ratio
In this paper we investigate similar triangles which are not congruent but have two pair congruent sides. We show that greatest lower bound of values for similarity ratio of such triangles is golden ratio. For right triangles, we prove that the supremum of values for similarity ratio is the square root of the golden ratio.
متن کامل