Let's look at the sum of the triple. This does not change after each step since (y+z−x)+(z+x−y)+(x+y−z)=x+y+z. Moreover, the values of the new triple do not depend on the order of the numbers in the original triple, since the terms are symmetrical in all three variables. Hence we may assume a<b<c and we can change the order of the numbers in the triple.
Solution 1: After the first step we get the triple (a+b−c,a+c−b,b+c−a) and we have
a+b−c<a+c−b<b+c−a,
after the second step we get the triple (3a−b−c,3b−a−c,3c−a−b) and we have
3a−b−c<3b−a−c<3c−a−b.
Let's look at the differences between individual numbers of the triple. By induction we check that after n steps we have the following:
* The difference between the smallest and the largest number in the triple is equal to 2n(c−a).
* The difference between the smallest and the middle number in the triple is equal to 2n(b−a) if n is even and 2n(c−b) if n is odd.
* The difference between the middle and the largest number in the triple is equal to 2n(c−b) if n is even and 2n(b−a) if n is odd.
After n steps we have the triple of the form (t,t+2n(b−a),t+2n(c−a)) if n is even and (t,t+2n(c−b),t+2n(c−a)) if n is odd. Here t is some integer which can be calculated from the condition on the sum. We have
2015=t+(t+2n(b−a))+(t+2n(c−a))=3t+2n(b+c−2a)⇒t=32015−2n(b+c−2a), if n even, and
2015=t+(t+2n(c−b))+(t+2n(c−a))=3t+2n(2c−a−b)⇒t=32015−2n(2c−a−b), if n odd.
If any of the numbers in the triple will be negative, it will surely be t. Since the sum of three consecutive numbers cannot equal 2015, the difference between the largest and the smallest number in the initial triple is at least 3. This gives c−a≥3. Thus we can estimate b+c−2a=(c−a)+(b−a)≥4 and 2c−a−b=(c−a)+(c−b)≥4. It follows
t≤32015−4⋅2n.
With the initial triple (670,672,673) we get t=32015−28(673+672−2⋅670)=245 after 8 steps. Therefore this triple does not yield a negative number after 8 steps.
So we have to make at least 9 steps to get a triple with at least one negative number.
Solution 2: Since a+b+c=2015, after the first step we get the triple (b+c−a,a+c−b,a+b−c)=(2015−2a,2015−2b,2015−2c). Thus in each step the transformation acts component-wise by the rule x↦2015−2x.
We can check by induction that if we apply this transformation n times to the number x we get
(−2)nx+31−(−2)n⋅2015.
Let's determine when this number is non-negative. For even n we must have
2nx+31−2n⋅2015⇔32015−x1⋅32015≥0≥2n.
For odd n we must have
−2nx+31+2n⋅2015⇔x−320151⋅32015≥0≥2n.
Since 2015 is not a sum of three consecutive positive integers, we must have a≤670 and c≥673. Inserting this in the above inequalities we get
2n≤32015−a1⋅32015≤32015−6701⋅32015=403⇒n≤8,
2n≤c−320151⋅32015≤673−320151⋅32015=42015⇒n≤8.
So we have to make at least 9 steps to get a triple with at least one negative number.