Maths Olympiad Prep

Library / /18 of 151

, 2014

Algebra Difficulty 6.0 National Olympiad Prove it Hungary

a)a) Prove that for every infinite sequence x1,x2,[0,1]x_1,x_2,\ldots\in[0,1] there exists some C>0C>0 such that for every positive integer rr there are positive integers nn, mm satisfying nmr|n-m|\ge r and xnxm<Cnm|x_n-x_m|<\frac{C}{|n-m|}.
b)b) Show that for every C>0C>0 there exists an infinite sequence x1,x2,[0,1]x_1,x_2,\ldots\in[0,1] and a positive integer rr such that xnxm>Cnm|x_n-x_m|>\frac{C}{|n-m|} holds true for every pair nn, mm of positive integers with nmr|n-m|\ge r.
(CIIM6, Costa Rica)
(5 pont)

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.