Scribd
Upload
264 views2 pages

1994 Usamo

Uploaded by

adeogun kehinde
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
264 views2 pages

1994 Usamo

Uploaded by

adeogun kehinde
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

AoPS Community 1994 USAMO

USAMO 1994
www.artofproblemsolving.com/community/c4492
by Makaveli, MithsApprentice, Andreas, darij grinberg, rrusczyk

– April 28th

1 Let k1 < k2 < k3 < · · · be positive integers, no two consecutive, and let sm = k1 +k2 +· · ·+km
for m = 1, 2, 3, . . . . Prove that, for each positive integer n, the interval [sn , sn+1 ) contains at
least one perfect square.

2 The sides of a 99-gon are initially colored so that consecutive sides are red, blue, red, blue, . . . ,
red, blue, yellow. We make a sequence of modifications in the coloring, changing the color of
one side at a time to one of the three given colors (red, blue, yellow), under the constraint that
no two adjacent sides may be the same color. By making a sequence of such modifications,
is it possible to arrive at the coloring in which consecutive sides
are red, blue, red, blue, red, blue, . . . , red, yellow, blue?

3 A convex hexagon ABCDEF is inscribed in a circle such that AB = CD = EF and diagonals


AD, BE, and CF are concurrent. Let P be the intersection of AD and CE. Prove that CP/P E =
(AC/CE)2 .
Pn √
4 Let a1 , a2 , a3 , . . . be a sequence of positive real numbers satisfying j=1 aj ≥ n for all
n ≥ 1. Prove that, for all n ≥ 1,
n  
X
2 1 1 1
aj > 1 + + ··· + .
4 2 n
j=1

5 Let |U |, σ(U ) and π(U ) denote the number of elements, the sum, and the product, respec-
tively, of a finite set U of positive integers. (If U is the empty
 set, |U | =n!0, σ(U ) = 0, π(U ) = 1.)
n
Let S be a finite set of positive integers. As usual, let k denote k! (n−k)! . Prove that
 
X m − σ(U )
(−1)|U | = π(S)
|S|
U ⊆S

for all integers m ≥ σ(S).

–
These problems are copyright © Mathematical Association of America (http://maa.org).

© 2019 AoPS Incorporated 1


AoPS Community 1994 USAMO

© 2019 AoPS Incorporated 2


Art of Problem Solving is an ACS WASC Accredited School.

You might also like