1969 Canadian MO Problems/Problem 7

Revision as of 13:50, 28 July 2006 by 4everwise (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


Show that there are no integers $\displaystyle a,b,c$ for which $\displaystyle a^2+b^2-8c=6$.


Note that all perfect squares are equivilant to $\displaystyle 0,1,4\pmod8.$ Hence, we have $\displaystyle a^2+b^2\equiv 6\pmod8.$ It's impossible to obtain a sum of $\displaystyle 6$ with two of $\displaystyle 0,1,4,$ so our proof is complete.

Invalid username
Login to AoPS