- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
China
Team Selection Test
1998
Day 1
1 Find k ∈ N such that
a.) For any n ∈ N, there does not exist j ∈ Z which satisfies the conditions 0 ≤ j ≤ n − k + 1
and n , n , . . . , n forms an arithmetic progression.
j j + 1 j + k − 1
b.) There exists n ∈ N such that there exists j which satisfies 0 ≤ j ≤ n − k + 2, and
n , n , . . . , n forms an arithmetic progression.
j j + 1 j + k − 2
Find all n which satisfies part b.)
Corrected due to the courtesy of
[url=http://www.mathlinks.ro/Forum/profile.php?mode=viewprofileu=2616]zhaoli.[/url]
2 n ≥ 5 football teams participate in a round-robin tournament. For every game played, the
winner receives 3 points, the loser receives 0 points, and in the event of a draw, both teams
receive 1 point. The third-from-bottom team has fewer points than all the teams ranked
before it, and more points than the last 2 teams; it won more games than all the teams before
it, but fewer games than the 2 teams behind it. Find the smallest possible n.
π
3 For a fixed θ ∈ [0, ], find the smallest a ∈ R+ which satisfies the following conditions:
2
√a √a
I. + 1.
cos θ sin θ
II. There exists x ∈ [1 − √a , √a ] such that [(1 − x) sin θ − a − x2 cos2 θ]2 + [x cos θ −
sin θ cos θ
a − (1 − x)2 sin2 θ]2 ≤ a.
This file was downloaded from the AoPS − MathLinks Math Olympiad Resources Page
/ Page 1 http://www.mathlinks.ro/
原创力文档


文档评论(0)