Problem

Source: Turkey TST 2013 - Day 2 - P1

Tags: algebra, polynomial, number theory, greatest common divisor, modular arithmetic, number theory proposed, nice problem



Find all pairs of integers $(m,n)$ such that $m^6 = n^{n+1} + n -1$.