The answer section is in, I’m going to ask you a question!
Place an integer Xi at each vertex of a pentagon, and their sum S = ∑xi > 0. If x, y, z are numbers placed on three consecutive vertices, and y < 0, then replace (x, y, z) with (x, -y, y, z). Repeat this as long as there is a y < 0. Determine whether this algorithm will always stop.
Replies (8)
— All replies loaded —