✔ 最佳答案
Use MI. The case n=1 is trivial.
Suppose the statement holds for n.
Consider n+1 distinct positive integers a1,...,a_(n+1), and a set M of n positive integers not containing s=a1+...+a_(n+1).
WLOG, let a_(n+1) be the largest integer among a1,...,a_(n+1), and let m be the largest integer in M.
By induction hypothesis, the is some order of a1,...,an such that he grasshopper never lands on M\{m}. Write this order as b1, b2, ..., bn.
If for this order b1,...,bn, the grasshopper does not land on m either, then we can add a_(n+1) as the last step. Then the grasshopper will not land on M either because s in not in M.
If the grasshopper lands on m on some step bk, we can consider the order
b1,...,b_(k-1), a_(n+1), bk,...,bn
The grasshopper does not land on M on the first k-1 steps by our choice of the order b1,...,bn.
Then on the step a_(n+1), because a_(n+1) is the largest of the n+1 integers and b1+...+bk=m, we have
b1+...+b-(k-1)+a_(n+1)>m.
Hence the grasshopper does not land on m at the step a_(n+1). But because m is the largest element of M, the grasshopper in fact does not land on any element of M at the step a_(n+1) and all following steps bk,...,bn. Hence we are done.