Skip to main content

Proof Without Words: Squares Modulo 3

Buy Article:

$20.00 plus tax (Refund Policy)

Abstract:

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

DOI: http://dx.doi.org/10.4169/college.math.j.44.4.283

Publication date: September 1, 2013

More about this publication?
maa/cmj/2013/00000044/00000004/art00005
dcterms_title,dcterms_description,pub_keyword
6
5
20
40
5

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
X
Cookie Policy
Ingenta Connect 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