Number theory · Divisibility · Modular arithmetic · Diophantine equations

Problem 1, 2015

← Prev · 9 / 186 · Next →

CityProof

Prove that no integers \(m\) and \(n\) satisfy

\[ (m + n + 2)^2 = 3(mn + 1). \]

Sign in to check answers, open hints, read the full solution, and track your progress. Statements are always free.

Serbian Municipal Competition 2015, high school grade I, category A, problem 1. Organized by the Mathematical Society of Serbia (DMS). Source