Skip to main content

Proof Without Words: Squares Modulo 3

Buy Article:

$20.00 plus tax (Refund Policy)

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).
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Data/Media
No Metrics

Document Type: Research Article

Publication date: 2013-09-01

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
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