Positive integers x1,...,xm (not necessarily distinct) are written on a blackboard. It is known that each of the numbers F1,...,F2018 can be represented as a sum of one or more of the numbers on the blackboard. What is the smallest possible value of m?
(Here F1,...,F2018 are the first 2018 Fibonacci numbers: F1=F2=1,Fk+1=Fk+Fk−1 for k>1.) algebraFibonacciAdditive Number TheoryExtremal combinatorics