IMO 2009

来源: 康MM 2009-07-24 03:51:50 [] [博客] [旧帖] [给我悄悄话] 本文已被阅读: 次 (1767 bytes)
本文内容已被 [ 康MM ] 在 2009-07-28 16:38:03 编辑过。如有问题,请报告版主或论坛管理删除.
Problem 1. Let n be a positive integer and let a1, a2, a3, ..., ak ( k≥ 2) be distinct integer in the set { 1, 2, ..., n} such that n divides ai(ai+1-1) for i = 1, 2, ..., k-1. Prove that n does not divide ak(a1-1).

Problem 2. Let ABC be a triangle with circumcenter O. The points P and Q are interior points of the sides CA and AB respectively. Let K, L and M be the midpoints of the segments BP, CQ and PQ. respectively, and let Γ be the circle passing through K, L and M. Suppose that the line PQ is tangent to the circle Γ. Prove that OP = OQ.

Problem 3. Suppose that s1, s2, s3, ... is a strictly increasing sequence of positive integers such that the sub-sequences ss_{1}, ss_{2}, ss_{3}, ... and ss_{1+1}, ss_{2+1}, ss_{3+1}, ... are both arithmetic progressions. Prove that the sequence s1, s2, s3, ... is itself an arithmetic progression.

Problem 4. Let ABC be a triangle with AB = AC. The angle bisectors of CAB and ABC meet the sides BC and CA at D and E, respectively. Let K be the incentre of triangle ADC. Suppose that angle BEK = 45. Find all possible values of angle CAB.

Problem 5. Determine all functions f from the set of positive integers to the set of positive integers such that, for all positive integers a and b, there exists a non-degenerate triangle with sides of lengths a, f(b), abd f(b+f(a)-1).

Problem 6. Let a1, a2, ..., an be distinct positive integers and let M be a set of positive integers not containing s = a1 + a2 + ... + an. A grasshopper is to jump along the real axis, starting at the point 0 and making n jumps to the right with lengths a1, a2, ..., an in some order. Prove that the order can be chosen in such a way that the grasshopper never lands on any point in M.


所有跟帖: 

回复:IMO 2009 -康MM- 给 康MM 发送悄悄话 康MM 的博客首页 (563 bytes) () 07/24/2009 postreply 04:00:28

China's rank -botong- 给 botong 发送悄悄话 botong 的博客首页 (243 bytes) () 07/24/2009 postreply 08:29:10

回复:China's rank -于德利- 给 于德利 发送悄悄话 于德利 的博客首页 (77 bytes) () 07/24/2009 postreply 19:54:05

Problem 6 -botong- 给 botong 发送悄悄话 botong 的博客首页 (422 bytes) () 07/24/2009 postreply 10:32:52

通常第六题不是最难的 -累死算了- 给 累死算了 发送悄悄话 (148 bytes) () 07/26/2009 postreply 01:05:48

通常第六题是最难的 -botong- 给 botong 发送悄悄话 botong 的博客首页 (408 bytes) () 07/26/2009 postreply 09:25:21

有点问题吧 -dynamic- 给 dynamic 发送悄悄话 (226 bytes) () 07/26/2009 postreply 22:14:34

回复:有点问题吧 -botong- 给 botong 发送悄悄话 botong 的博客首页 (209 bytes) () 07/27/2009 postreply 11:01:10

回复:回复:有点问题吧 -dynamic- 给 dynamic 发送悄悄话 (79 bytes) () 07/27/2009 postreply 18:12:36

回复:回复:回复:有点问题吧 -botong- 给 botong 发送悄悄话 botong 的博客首页 (91 bytes) () 07/28/2009 postreply 10:22:54

Don't understand Problem 6 -dayuwang- 给 dayuwang 发送悄悄话 (166 bytes) () 07/24/2009 postreply 12:29:19

回复:Don't understand Problem 6 -botong- 给 botong 发送悄悄话 botong 的博客首页 (79 bytes) () 07/24/2009 postreply 12:59:16

That makes sense. Thanks. -dayuwang- 给 dayuwang 发送悄悄话 (0 bytes) () 07/24/2009 postreply 16:25:42

Where do you see that M is a given set with n-1 points? -Noneandnone- 给 Noneandnone 发送悄悄话 (0 bytes) () 07/24/2009 postreply 18:32:58

康MM把这条件去掉了:) -botong- 给 botong 发送悄悄话 botong 的博客首页 (78 bytes) () 07/24/2009 postreply 19:16:06

好家伙,前5名:中国,日本,南北朝鲜,俄罗斯 -于德利- 给 于德利 发送悄悄话 于德利 的博客首页 (180 bytes) () 07/24/2009 postreply 19:52:41

还有一个:#23 澳大利亚,5/6是中国人 -于德利- 给 于德利 发送悄悄话 于德利 的博客首页 (0 bytes) () 07/25/2009 postreply 09:38:27

第2题 -说了就走- 给 说了就走 发送悄悄话 说了就走 的博客首页 (29 bytes) () 07/25/2009 postreply 11:14:19

Problem 4 -HavingFun2- 给 HavingFun2 发送悄悄话 (29 bytes) () 07/26/2009 postreply 11:22:39

回复:Problem 4 -HavingFun2- 给 HavingFun2 发送悄悄话 (63 bytes) () 08/18/2009 postreply 12:32:56

problem 2 is too easy -zlinux- 给 zlinux 发送悄悄话 (230 bytes) () 07/26/2009 postreply 12:00:43

problem 1 -屋漏痕- 给 屋漏痕 发送悄悄话 屋漏痕 的博客首页 (1080 bytes) () 07/27/2009 postreply 10:29:08

Problem 6 -屋漏痕- 给 屋漏痕 发送悄悄话 屋漏痕 的博客首页 (521 bytes) () 07/27/2009 postreply 12:16:59

回复:Problem 6 -dynamic- 给 dynamic 发送悄悄话 (217 bytes) () 07/27/2009 postreply 18:18:33

回复:回复:Problem 6 -屋漏痕- 给 屋漏痕 发送悄悄话 屋漏痕 的博客首页 (224 bytes) () 07/28/2009 postreply 05:53:51

回复:回复:回复:Problem 6 -dynamic- 给 dynamic 发送悄悄话 (195 bytes) () 07/28/2009 postreply 09:14:51

回复:回复:回复:回复:Problem 6 -屋漏痕- 给 屋漏痕 发送悄悄话 屋漏痕 的博客首页 (79 bytes) () 07/28/2009 postreply 10:07:10

still off a littlt bit. -屋漏痕- 给 屋漏痕 发送悄悄话 屋漏痕 的博客首页 (0 bytes) () 07/28/2009 postreply 10:58:07

This one might be right, but I might be wrong. -屋漏痕- 给 屋漏痕 发送悄悄话 屋漏痕 的博客首页 (1042 bytes) () 07/28/2009 postreply 12:39:19

The solution to problem 6 and thanks to dynamic -botong- 给 botong 发送悄悄话 botong 的博客首页 (2810 bytes) () 07/28/2009 postreply 17:28:00

excellent proof, needs correction in some places. -dynamic- 给 dynamic 发送悄悄话 (673 bytes) () 07/28/2009 postreply 23:44:13

Thanks -botong- 给 botong 发送悄悄话 botong 的博客首页 (58 bytes) () 07/29/2009 postreply 08:15:04

Here is a new version -botong- 给 botong 发送悄悄话 botong 的博客首页 (2693 bytes) () 07/29/2009 postreply 08:34:38

Great! -乱弹- 给 乱弹 发送悄悄话 乱弹 的博客首页 (0 bytes) () 07/30/2009 postreply 17:49:50

请您先登陆,再发跟帖!

发现Adblock插件

如要继续浏览
请支持本站 请务必在本站关闭/移除任何Adblock

关闭Adblock后 请点击

请参考如何关闭Adblock/Adblock plus

安装Adblock plus用户请点击浏览器图标
选择“Disable on www.wenxuecity.com”

安装Adblock用户请点击图标
选择“don't run on pages on this domain”