首页 USA-USAMO-2006-美国奥数竞赛

USA-USAMO-2006-美国奥数竞赛

举报
开通vip

USA-USAMO-2006-美国奥数竞赛 USA USAMO 2006 Day 1 1 Let p be a prime number and let s be an integer with 0 < s < p. Prove that there exist integers m and n with 0 < m < n < p and{ sm p } < { sn p } < s p if and only if s is not a divisor of p− 1. Note: For x a real number, let...

USA-USAMO-2006-美国奥数竞赛
USA USAMO 2006 Day 1 1 Let p be a prime number and let s be an integer with 0 < s < p. Prove that there exist integers m and n with 0 < m < n < p and{ sm p } < { sn p } < s p if and only if s is not a divisor of p− 1. Note: For x a real number, let bxc denote the greatest integer less than or equal to x, and let {x} = x− bxc denote the fractional part of x. 2 For a given positive integer k find, in terms of k, the minimum value of N for which there is a set of 2k+1 distinct positive integers that has sum greater than N but every subset of size k has sum at most N2 . 3 For integral m, let p(m) be the greatest prime divisor of m. By convention, we set p(±1) = 1 and p(0) =∞. Find all polynomials f with integer coefficients such that the sequence {p (f (n2))− 2n}n≥0 is bounded above. (In particular, this requires f ( n2 ) 6= 0 for n ≥ 0.) http://www.artofproblemsolving.com/ This file was downloaded from the AoPS Math Olympiad Resources Page Page 1 USA USAMO 2006 Day 2 1 Find all positive integers n such that there are k ≥ 2 positive rational numbers a1, a2, . . . , ak satisfying a1 + a2 + . . .+ ak = a1 · a2 · · · ak = n. 2 A mathematical frog jumps along the number line. The frog starts at 1, and jumps according to the following rule: if the frog is at integer n, then it can jump either to n+1 or to n+2mn+1 where 2mn is the largest power of 2 that is a factor of n. Show that if k ≥ 2 is a positive integer and i is a nonnegative integer, then the minimum number of jumps needed to reach 2ik is greater than the minimum number of jumps needed to reach 2i. 3 Let ABCD be a quadrilateral, and let E and F be points on sides AD and BC, respectively, such that AEED = BF FC . Ray FE meets rays BA and CD at S and T, respectively. Prove that the circumcircles of triangles SAE, SBF, TCF, and TDE pass through a common point. http://www.artofproblemsolving.com/ This file was downloaded from the AoPS Math Olympiad Resources Page Page 2
本文档为【USA-USAMO-2006-美国奥数竞赛】,请使用软件OFFICE或WPS软件打开。作品中的文字与图均可以修改和编辑, 图片更改请在作品中右键图片并更换,文字修改请直接点击文字进行修改,也可以新增和删除文档中的内容。
该文档来自用户分享,如有侵权行为请发邮件ishare@vip.sina.com联系网站客服,我们会及时删除。
[版权声明] 本站所有资料为用户分享产生,若发现您的权利被侵害,请联系客服邮件isharekefu@iask.cn,我们尽快处理。
本作品所展示的图片、画像、字体、音乐的版权可能需版权方额外授权,请谨慎使用。
网站提供的党政主题相关内容(国旗、国徽、党徽..)目的在于配合国家政策宣传,仅限个人学习分享使用,禁止用于任何广告和商用目的。
下载需要: 免费 已有0 人下载
最新资料
资料动态
专题动态
is_807922
暂无简介~
格式:pdf
大小:63KB
软件:PDF阅读器
页数:2
分类:
上传时间:2010-06-26
浏览量:22