You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:


Log in to your personal account or through your institution.

Proof Without Words: Squares Modulo 3

Roger B. Nelsen
The College Mathematics Journal
Vol. 44, No. 4 (September 2013), p. 283
DOI: 10.4169/college.math.j.44.4.283
Stable URL:
Page Count: 1
  • Download ($16.00)
  • Cite this Item
Item Type
Preview not available
Preview not available


Summary Using the fact that the sum of the first n odd numbers is n2, we show visually that n2 ≣ 0 (mod 3) when n ≣ 0 (mod 3), and n2 ≣ 1 (mod 3) when n ≣ ±1 (mod 3).

Page Thumbnails