Prove that for all integers n ≥ 1, 10" = (-1)" (mod 11). Use part (a) to prove that a positive integer is divisi- ble by 11 if, and only if, the alternating sum of its dig- its is divisible by 11. (For instance, the alternating sum of the digits of 82,379 is 8-2+3-7+9 = 11 and 82,379 11-7489.) =

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
b.
13. a. Prove that for all integers n ≥ 1, 10" = (-1)" (mod 11).
Use part (a) to prove that a positive integer is divisi-
ble by 11 if, and only if, the alternating sum of its dig-
its is divisible by 11. (For instance, the alternating sum
of the digits of 82,379 is 8-2+3-7+9 = 11 and
82,379 11.7489.)
=
Transcribed Image Text:b. 13. a. Prove that for all integers n ≥ 1, 10" = (-1)" (mod 11). Use part (a) to prove that a positive integer is divisi- ble by 11 if, and only if, the alternating sum of its dig- its is divisible by 11. (For instance, the alternating sum of the digits of 82,379 is 8-2+3-7+9 = 11 and 82,379 11.7489.) =
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

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