# vecror problem for the best only

• July 6th 2013, 04:56 AM
hacen
vecror problem for the best only
Attachment 28743
ps : sorry for my english ; i don't speak english very well it obvious (Speechless) .so sorry (Cool)
• July 6th 2013, 05:28 AM
HallsofIvy
Re: vecror problem for the best only
Tedious, but I think the most straightforward way is to set up a coordinate system so that B is at the origin and C is on the x-axis, at (c, 0). You can take A to be at (a, b) and then find the coordinates of the other points.
• July 6th 2013, 05:51 AM
Plato
Re: vecror problem for the best only
Quote:

Originally Posted by hacen

As written (or labelled) I don't think it is true.

Consider that $\overleftrightarrow {DE} \cap \overleftrightarrow {CE} = \left\{ E \right\}$, but if $G \in \overleftrightarrow {DE} \wedge G \in \overleftrightarrow {CE}$ then that means
$G=E$ but $G$ is the mid-point of $\overline{CE}$.

• July 6th 2013, 09:02 AM
hacen
Re: vecror problem for the best only
sorry it my fault ;it is not line (DE) but is (DB)
so : Prove that lines (DB) and (AF) met in G.
Attachment 28745
• August 14th 2013, 06:52 PM