Problem

Source: Bulgaria EGMO TST 2015 Day 2 Problem 1 (out of 4); IMO Shortlist 1992

Tags: algebra, polynomial, Vieta



Prove that for every positive integer $m$ there are infinitely many pairs $(x,y)$ of coprime positive integers such that $x$ divides $y^2 + m$ and $y$ divides $x^2 + m$.