Problem

Source: Finland 2013, Problem 5

Tags: modular arithmetic, quadratics, search, number theory, Finland



Find all integer triples $(m,p,q)$ satisfying \[2^mp^2+1=q^5\] where $m>0$ and both $p$ and $q$ are prime numbers.