MathDB

1

Part of 1995 Vietnam Team Selection Test

Problems(2)

Radical axes of the circumcircles of the pairs of triangles

Source: Vietnam TST 1995, Problem 1

7/27/2008
Let be given a triangle ABC ABC with BC \equal{} a, CA \equal{} b, AB \equal{} c. Six distinct points A1 A_1, A2 A_2, B1 B_1, B2 B_2, C1 C_1, C2 C_2 not coinciding with A A, B B, C C are chosen so that A1 A_1, A2 A_2 lie on line BC BC; B1 B_1, B2 B_2 lie on CA CA and C1 C_1, C2 C_2 lie on AB AB. Let α \alpha, β \beta, γ \gamma three real numbers satisfy \overrightarrow{A_1A_2} \equal{} \frac {\alpha}{a}\overrightarrow{BC}, \overrightarrow{B_1B_2} \equal{} \frac {\beta}{b}\overrightarrow{CA}, \overrightarrow{C_1C_2} \equal{} \frac {\gamma}{c}\overrightarrow{AB}. Let dA d_A, dB d_B, dC d_C be respectively the radical axes of the circumcircles of the pairs of triangles AB1C1 AB_1C_1 and AB2C2 AB_2C_2; BC1A1 BC_1A_1 and BC2A2 BC_2A_2; CA1B1 CA_1B_1 and CA2B2 CA_2B_2. Prove that dA d_A, dB d_B and dC d_C are concurrent if and only if \alpha a \plus{} \beta b \plus{} \gamma c \neq 0.
geometrycircumcirclegeometry unsolved
Find greatest possible length k of a circuit in such a graph

Source: Vietnam TST 1995, Problem 4

7/27/2008
A graph has n n vertices and \frac {1}{2}\left(n^2 \minus{} 3n \plus{} 4\right) edges. There is an edge such that, after removing it, the graph becomes unconnected. Find the greatest possible length k k of a circuit in such a graph.
combinatorics unsolvedcombinatorics