Problem

Source: 2021 MEMO T-7

Tags: number theory, Diophantine equation, memo, MEMO 2021, easy number theorem



Find all pairs $(n, p)$ of positive integers such that $p$ is prime and \[ 1 + 2 + \cdots + n = 3 \cdot (1^2 + 2^2 + \cdot + p^2). \]