A function f:R→R is essentially increasing if f(s)≤f(t) holds whenever s≤t are real numbers such that f(s)=0 and f(t)=0 .
Find the smallest integer k such that for any 2022 real numbers x1,x2,…,x2022, there exist k essentially increasing functions f1,…,fk such that f1(n)+f2(n)+⋯+fk(n)=xnfor every n=1,2,…2022.
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.