Let n e Z. Prove that n² + 4 is divisible by 8 if and only if 3n + 6 is divisible by 12. (Hint: the statements n | m, 3k e Z: m = nk, m = 0 (mod n) are all equivalent)

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.5: Congruence Of Integers
Problem 57E
icon
Related questions
Question
Let n e Z. Prove that n2 + 4 is divisible by 8 if and only if 3n + 6 is divisible by 12.
(Hint: the statements
n | m,
3k E Z: m = nk,
m = 0 (mod n)
are all equivalent)
Transcribed Image Text:Let n e Z. Prove that n2 + 4 is divisible by 8 if and only if 3n + 6 is divisible by 12. (Hint: the statements n | m, 3k E Z: m = nk, m = 0 (mod n) are all equivalent)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning
College Algebra
College Algebra
Algebra
ISBN:
9781305115545
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning