41
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Proof Without Words: Squares Modulo 3

 

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).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.