Maths Olympiad Prep

Library / /123 of 151

, 2017

Algebra Difficulty 8.0 Shortlist Prove it Hungary

We say that a strictly increasing positive real sequence a1,a2,a_1,a_2,\dots is an elf sequence if for any c>0c>0 we can find an NN such that an<cna_n<cn for n=N,N+1,.n=N,N+1,\dots\,. Furthermore, we say that ana_n is a hat if ani+an+i<2ana_{n-i}+a_{n+i}<2a_n for 1in11\le i\le n-1. Is it true that every elf sequence has infinitely many hats?

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.