Problem

Source: Belarusian National Olympiad 2023

Tags: number theory



An unordered triple $(a,b,c)$ in one move can be changed to either of the triples: $(a,b,2a+2b-c)$,$(a,2a+2c-b,c)$ or $(2b+2c-a,b,c)$. Can one get from triple $(3,5,14)$ the triple $(9,8,11)$ in finite amount of moves?