Re: [問題] IMO 2013 in Colombia Day 2

作者: cmrafsts (喵喵)   2013-07-27 10:02:17
※ 引述《FAlin (FA(バルシェ應援))》之銘言:
: 4. Let ABC be an acute triangle with orthocenter H, and let W be apoint on
: the side BC, between B and C. The points M and N are the feet of the
: altitudes drawn from B and C, respectively. ω_1 is the circumcircle of
: triangle BWN, and X is a point such that WX is a diameter of ω_1.
: Similarly, ω_2 is the circumcircle of triangle CWM, and Y is a point
: such that WY is a diameter of ω_2. show that the points X, Y, and H are
: collinear.
: 5. Let Q>0 be the set of all rational numbers greater than zero. Let
: f: Q>0 → R be a function satisfying the following conditions:
: (i) f(x)f(y) ≧ f(xy) for all x,y ∈ Q>0,
: (ii) f(x+y) ≧ f(x) + f(y) for all x,y ∈ Q>0
: (iii) There exists a rational number a>1 such that f(a) = a
: Show that f(x) = x for all x∈Q>0.
: 6. Let n≧3 be an integer, and consider a circle with n+1 equally spaced
: points marked on it. Consider all labellings of these points with the
: numbers 0,1,..., n such that each label is used exactly once; two such
: labellings are considered to be the same if one can be obtained from
: the other by a rotation of the circle. A labelling is called beautiful
: if, for any four labels a<b<c<d with a+d=b+c, the chord joining the
: points labelled a and d does not intersect the chord joining the points
: labelled b and c.
: Let M be the number of beautiful labellings and let N be the number of
: ordered pairs (x,y) of positive integers such that x+y≦n and
: gcd(x,y)=1.
: Prove that M = N+1.
作者: Dawsen (好友名單不見了啦...)   2013-07-27 10:51:00
wow... 厲害... 原來歸納法行得通!
作者: Dawsen (好友名單不見了啦...)   2013-07-27 10:52:00
我後來是用 "以0開頭k結尾的直線BL恰Φ(k)個"直接構造
作者: Dawsen (好友名單不見了啦...)   2013-07-27 10:53:00
不過可以把k當成第二個 可以證明假設0緊接的下一個是k的話
作者: Dawsen (好友名單不見了啦...)   2013-07-27 10:54:00
1. 所有相差是k的一定得按照順序排 而且a, a+k中間不能有
作者: Dawsen (好友名單不見了啦...)   2013-07-27 10:55:00
間隔,否則考慮第一個不滿足條件的元素可以導致矛盾2. 接下來就是mod k剩餘系的排列問題。 第一個已經是餘0
作者: Dawsen (好友名單不見了啦...)   2013-07-27 10:56:00
假設下一個是餘x的話,可以證明之後餘a的一定得在餘a+x之前
作者: Dawsen (好友名單不見了啦...)   2013-07-27 10:57:00
出現,所以(x,k)=1, 而且一種這種排列都是唯一,且是BL
作者: Dawsen (好友名單不見了啦...)   2013-07-27 10:58:00
多的1是k=1的情形。BTW, 把k當成第二個 意思是把0當第一個
作者: Dawsen (好友名單不見了啦...)   2013-07-27 11:07:00
對了..(1)我有疑問。重新調位置之後,還會平行嗎? 如果會
作者: Dawsen (好友名單不見了啦...)   2013-07-27 11:08:00
平行,好像就不用證了。如果不平行, 0,2k+1也有可能相鄰
作者: Dawsen (好友名單不見了啦...)   2013-07-27 11:09:00
還是說你只是寫sketch, 進一步分析可發現不為BL?
作者: Dawsen (好友名單不見了啦...)   2013-07-27 11:47:00
(3)的ai+al-aj也有可能會=kd for some integer d?
作者: cmrafsts (喵喵)   2013-07-27 13:50:00
這是要模k後的結果阿,所以小於2k
作者: cmrafsts (喵喵)   2013-07-27 13:56:00
我不太理解學長對(1)的疑問,不過我上面寫的應該不足以完成(1)的證明。2k+1時我們直接考慮0---2k+1
作者: cmrafsts (喵喵)   2013-07-27 14:01:00
不,這樣好像證不出(1),雖然要可以證出但我在凌晨證不出請學長們先看看怎麼證...簡哥唬爛我說這樣能證...
作者: hahaj6u4503 (風雲。月)   2013-07-27 16:43:00
我也打算用歸納法,(1)太強了沒觀察到!!
作者: cmrafsts (喵喵)   2013-07-28 01:21:00
喔有了,反正只要再管0n相鄰,拖(3)救援WWW
作者: adaadaadaben (bumblerben)   2013-07-29 07:34:00
偷偷問一下樓主是?XD
作者: cmrafsts (喵喵)   2013-07-31 08:11:00
TWN1,台灣最低分 我知道樓上是誰喔~~~

Links booklink

Contact Us: admin [ a t ] ucptt.com