cool math games boombot funbrain cool math games civiballs cooking games cool math games kids cool math games crazy taxi cool games cool educational games
Tuesday, November 16, 2010
2nd Australian Mathematical Olympiad Problems 1981
A1. Show that in any set of 27 distinct odd positive numbers less than 100 we can always find two with sum 102. How many sets of 26 odd positive numbers less 100 than can we find with no two having sum 102? A2. Given a real number 0 < k < 1, define p(x) = (x - k)(x - k2) ... (x - kn)/( (x + k)(x + k2) ... (x + kn) ). Show that if kn+1 ≤ x < 1, then p(x) < p(1).
Subscribe to:
Post Comments (Atom)
Popular Posts
-
1. p(x) is a quadratic polynomial with non-negative coefficients. Show that p(xy)2 ≤ p(x2)p(y2). 2. A convex polygo...
-
A1. Prove that (21n+4)/(14n+3) is irreducible for every natural number n. A2. For what real values of x is √(x + √(2x-1)) ...
-
1. Show that x4 > x - 1/2 for all real x. 2. The line joining the midpoints of two opposite sides of a convex quadril...
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.