Proof Without Words: Squares Modulo 3
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.
Document Type: Research Article
Publication date: 2013-09-01
More about this publication?
- The College Mathematics Journal is designed to enhance classroom learning and stimulate thinking regarding undergraduate mathematics. CMJ publishes articles, short Classroom Capsules, problems, solutions, media reviews and other pieces. All are aimed at the college mathematics curriculum with emphasis on topics taught in the first two years.
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Membership Information
- Information for Advertisers
- Terms & Conditions
- MAA Journals at ingentaconnect
- MAA Store
- Ingenta Connect is not responsible for the content or availability of external websites