Let n be an integer. Prove that if n is not divisible by 3, then n² has remainder 1 when divided by 3.

Algebra: Structure And Method, Book 1
(REV)00th Edition
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Chapter5: Factoring Polynomials
Section5.7: Factoring Pattern For X2+bx+c, C Positive
Problem 4OE
icon
Related questions
Question
Let n be an integer. Prove that if n is not divisible by 3, then n² has
remainder 1 when divided by 3.
Transcribed Image Text:Let n be an integer. Prove that if n is not divisible by 3, then n² has remainder 1 when divided by 3.
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Recommended textbooks for you
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage