- Show that (a + b)" = a + bn mod 2 for all integers a, b, and n with n > 0. Hint: Try looking at the cases where a is even (b can be either even or odd) or b is even (a can be either even or odd) and the case where both a and b are odd. 40

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
5. Show that (a + b)n = a + bn mod 2 for all integers a, b, and n with n > 0.
Hint: Try looking at the cases where a is even (b can be either even or odd) or b is even (a can
be either even or odd) and the case where both a and b are odd.
Transcribed Image Text:5. Show that (a + b)n = a + bn mod 2 for all integers a, b, and n with n > 0. Hint: Try looking at the cases where a is even (b can be either even or odd) or b is even (a can be either even or odd) and the case where both a and b are odd.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer