Xem bài viết đơn
Old 26-03-2016, 10:20 PM   #17
TNP
+Thành Viên+
 
TNP's Avatar
 
Tham gia ngày: Feb 2012
Đến từ: PTNK TPHCM
Bài gởi: 180
Thanks: 487
Thanked 106 Times in 67 Posts
I think I can solve 3b with inversion, I will post the solution later. I think this is the hardest geometry problem in VNTST history.



Problem 5 is very nice, for 5b we only need to consider the case $n=k$ thanks to the results from 5a.
[RIGHT][I][B]Nguồn: MathScope.ORG[/B][/I][/RIGHT]
 
__________________
Believe in yourself $\Leftrightarrow$ Believe in miracles
TNP is offline   Trả Lời Với Trích Dẫn
 
[page compression: 7.99 k/9.03 k (11.55%)]