Problem

Source: Czech-Polish-Slovak 2004 Q2

Tags: limit, number theory unsolved, number theory



Show that for each natural number $k$ there exist only finitely many triples $(p, q, r)$ of distinct primes for which $p$ divides $qr-k$, $q$ divides $pr-k$, and $r$ divides $pq - k$.