Proof Without Words: Squares Modulo 3

$20.00 plus tax (Refund Policy)

Buy Article:


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

Document Type: Research Article


Publication date: September 1, 2013

More about this publication?
Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more