Consider a triple (a,b,c) of pairwise distinct positive integers satisfying a+b+c=2013. A step consists of replacing the triple (x,y,z) by the triple (y+z−x,z+x−y,x+y−z). Prove that, starting from the given triple (a,b,c), after 10 steps we obtain a triple containing at least one negative number. Triplepositive integerscombinatoricsnumber theorySum