For a nonempty set S of integers, let σ(S) be the sum of the elements of S. Suppose that A={a1,a2,…,a11} is a set of positive integers with a1<a2<⋯<a11 and that, for each positive integer n≤1500, there is a subset S of A for which σ(S)=n. What is the smallest possible value of a10? inductionnumber theory unsolvednumber theory