Difference between revisions of "AoPS Wiki talk:Problem of the Day/June 11, 2011"
(new problem talk page) |
(No difference)
|
Revision as of 23:21, 7 June 2011
Problem
AoPSWiki:Problem of the Day/June 11, 2011
Solution
This Problem of the Day needs a solution. If you have a solution for it, please help us out by adding it.
![[asy] //size(280); pointpen=black; pathpen = black; linewidth(1); pair A=(0,8), B=(8,8), C=(8,0), D=(0,0), E, F, G, H, J, K, L, M, X; E=(A+B)/2; F=(B+C)/2; G=(C+D)/2; H=(A+D)/2; X=(E+G)/2; J=(X+E)/2; K=(X+F)/2; L=(X+G)/2; M=(X+H)/2; D(A--B--K--L--D--M--J--B--C--L--M--A--J--K--C--D--A);D(H--F);D(E--G); MP("A",A,(-1, 1));MP("B",B,( 1, 1));MP("C",C,( 1,-1));MP("D",D,(-1,-1)); MP("E",E,( 0, 1));MP("F",F,( 1, 0));MP("G",G,( 0,-1));MP("H",H,(-1, 0)); MP("J",J,( 3, 0));MP("K",K,(0,3));MP("L",L,( 3, 0));MP("M",M,(0,3)); MP("X",X,(-1,-1)); [/asy]](http://latex.artofproblemsolving.com/7/4/5/74545fdeae450019069abdc4f2e2165c561944f9.png)
