Problem

Source: Ukraine 1998 Grade 11 P6

Tags: combinatorics, number theory



The numbers $1,1998,1999$ are written on the board. In each step it is allowed to replace one of the numbers by its square decreased by three times the product of the other two numbers. Is it possible to obtain three numbers with the sum $0$ after several steps?