Problem 6. Let a be an integer. Show that if 3 | a² then 9 | a². Hint: Rule out the cases a = 3k+1 and a = 3k + 2.
Problem 6. Let a be an integer. Show that if 3 | a² then 9 | a². Hint: Rule out the cases a = 3k+1 and a = 3k + 2.
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.4: Multiplying Binomials Mentally
Problem 49WE
Related questions
Question
Problem 6. Let a be an integer. Show that if 3 | a 2 then 9 | a 2 . Hint: Rule out the cases a = 3k+1 and a = 3k + 2.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
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
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
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
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage