[Jprogramming] integers on a pentagon puzzle

[Miodrag Milenkovic]

There's an integer on each vertex of the pentagon. If there is a
negative integer, y on one of the vertices, flanked by x and z,
replace x, y, z by x+y, -y, z+y. Sum of all the numbers on the
pentagon is > 0. If there is more than one negative number, pick
whichever one you want. Does this procedure have to end?
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm