We say that a strictly increasing positive real sequence a1,a2,… is an elf sequence if for any c>0 we can find an N such that an<cn for n=N,N+1,…. Furthermore, we say that an is a hat if an−i+an+i<2an for 1≤i≤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.